Skip to main content
SpringerLink
Log in

On Complexity of Two Dimensional Languages Generated by Transducers

  • Conference paper
Implementation and Applications of Automata (CIAA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5148))

Included in the following conference series:

Abstract

We consider two-dimensional languages, called here 2d transducer languages, generated by iterative applications of transducers (finite state automata with output). To each transducer a two-dimensional language consisting of blocks of symbols is associated: the bottom row of a block is an input string accepted by the transducer and, by iterative application of the transducer, each row of the block is an output of the transducer on the preceding row. We observe that this class of languages is a proper subclass of recognizable picture languages containing the class of all factorial local 2d languages. By taking the average growth rate of the number of blocks in the language as a measure of its complexity, also known as the entropy of the language, we show that every entropy value of a one-dimensional regular language can be obtained as an entropy value of a 2d transducer language.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anselmo, M., Giammarresi, D., Madonia, M.: Tiling automaton: a computational model for recognizable two-dimensional languages. In: Holub, J., Žd’árek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 290–302. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Harju, T., Karhumäki, J., Lepisto, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 36–47. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous recognizable two-dimensional languages. RAIRO - Inf. Theor. Appl. 40, 277–293 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chakraborty, B., Jonoska, N., Seeman, N.C.: Programmable tranducer by DNA self-assembly (submitted)

    Google Scholar 

  5. Giammarresi, D., Restivo, A.: Recognizable picture languages. In: Nivat, M., Saoudi, A., Wang, P.S.P. (eds.) Proc. 1st Internat. Colloq. on Parallel Image Processing; also in Internat. J. Pattern Recognition Artif. Intell. 6, 231–256 (1992)

    Google Scholar 

  6. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of Formal Languages, vol. 3, pp. 215–267. Springer, Berlin (1997)

    Google Scholar 

  7. Gottschalk, W.H., Hedlund, G.A.: Topological Dynamics. AMS Colloquium Pubs. 36 (1955)

    Google Scholar 

  8. Jonoska, N., Liao, S., Seeman, N.C.: Transducers with programmable input by DNA self-assembly. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 219–240. Springer, Heidelberg (2003)

    Google Scholar 

  9. Jonoska, N., Pirnot, J.B.: Transitivity in two-dimensional local languages defined by dot systems. International Journal of Foundations of Computer Science 17, 435–464 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Jonoska, N., Pirnot, J.B.: Finite state automata representing two-dimensional subshifts. In: Holub, J., Žd’árek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 277–289. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Kari, J.: A small aperiodic set of Wang tiles. Discrete Math. 160(1-3), 259–264 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kari, J., Moore, C.: Rectangles and squares recognized by two-dimensional automata, http://www.santafe.edu/~moore/pubs/picture.html

  13. Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 396–406. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Kari, J.: private communication

    Google Scholar 

  15. Kitchens, B., Schmidt, K.: Automorphisms of compact groups. Ergod. Th. & Dynam. Sys. 9, 691–735 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kitchens, B., Schmidt, K.: Markov subgroups of \(({\mathbb Z}/2{\mathbb Z})^{\mathbb Z^2}\). In: Walters, P. (ed.) Symbolic Dynamics and its Applications; Contemporary Mathematics 135, 265–283 (1992)

    Google Scholar 

  17. Latteux, M., Simplot, D., Terlutte, A.: Iterated Length-Preserving Rational Transductions. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 286–295. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  19. Manca, V., Martin-Vide, C., Păun, G.: New computing paradigms suggested by DNA computing: computing by carving. BioSystems 52, 47–54 (1999)

    Article  Google Scholar 

  20. Păun, G.: On the iteration of gsm mappings. Rev. Roum. Math. Pures Appl. 23(4), 921–937 (1978)

    MATH  Google Scholar 

  21. Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature 394, 539–544 (1998)

    Article  Google Scholar 

  22. Winfree, E.: Algorithmic self-assembly of DNA: theoretical motivations and 2D assembly experiments. Journal of Biomolecular Structure and Dynamics 11 (S2), 263–270 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of South Florida, 4202 E. Fowler Ave Tampa, Fl 33620, USA

    Egor Dolzhenko & Nataša Jonoska

Authors
  1. Egor Dolzhenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nataša Jonoska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Oscar H. Ibarra Bala Ravikumar

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dolzhenko, E., Jonoska, N. (2008). On Complexity of Two Dimensional Languages Generated by Transducers. In: Ibarra, O.H., Ravikumar, B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70844-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70844-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70843-8

  • Online ISBN: 978-3-540-70844-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation