Skip to main content
SpringerLink
Log in

Generating words by cellular automata

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 520))

  • 147 Accesses

Abstract

Linear cellular automata with left-to-right communication are used for generating words. The terminal state of each cell corresponds to the symbol generated in the given position. In nondeterministic case such an automaton describes a language. The class obtained is exactly the class of context-sensitive languages. This fact provides a possible approach to defining context-sensitivity in the 2-dimensional case.

In the deterministic case generating infinite words rather than finite ones seems to be of interest. We show that all fixed points of (productive) substitutions and — in the 2-dimensional case — both regular and modular trellises can be generated.

This work was partially supported by the research grant SM-058 of Kuwait University.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Černý, A. — Gruska, J.: Modular trellises. In: Rosenberg, I. — Salomaa, A. (Eds.): The book of L. Springer, Berlin, 1986, 45–61

    Google Scholar 

  2. Culik, K. II — Gruska, J. — Salomaa, A.: Systolic trellis automata (for VLSI). University of Waterloo, 1982

    Google Scholar 

  3. Gruska, J.: Systolic automata — power, characterizations, nonhomogeneity. In: Chytil, M. — Koubek, V. (Eds.): Proceedings MFCS'84, Prague, Springer LNCS 176, Berlin, 1984

    Google Scholar 

  4. Korec, I.: Generalized Pascal Triangles. (in Slovak), doctoral thesis, Comenius University, 1984

    Google Scholar 

  5. Korec, I.: Personal communication.

    Google Scholar 

  6. Latteaux, M. — Timmerman, E.: Rational ω-transductions. In: Rovan, B. (Ed.): Proceedings MFCS'90, B. Bystrica, Springer LNCS 452, Berlin, 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Comenius University, Bratislava, Czechoslovakia

    Anton Černý

Authors
  1. Anton Černý
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Černý, A. (1991). Generating words by cellular automata. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation