Skip to main content
SpringerLink
Log in

Decision problems for cellular automata and their semigroups

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

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

  • 133 Accesses

Abstract

We associate to every one-dimensional cellular automaton a finitely presented semigroup. This semigroup is shown to have solvable word problem if and only if the common descendant problem is solvable for the cellular automaton. Connections with Culik and Yu's classification of cellular automata are investigated.

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. J. Albert and K. Culik II, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems 1 (1987), 1–16.

    MATH  MathSciNet  Google Scholar 

  2. W.W. Boone, Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems., Ann. of Math. (2) 83 (1966), 520–571.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Book, Confluent and other types of Thue systems, J. Assoc. Comp. Mach. 29 (1982), 171–182.

    MATH  MathSciNet  Google Scholar 

  4. K. Culik II and S. Yu, Undecidability of CA classification schemes, Complex Systems 2 (1988), 177–190.

    MATH  MathSciNet  Google Scholar 

  5. J. C. Shepherdson, Machine configuration and word problems of given degree of unsolvability, Z. Math. Log. Grund. Math. 11 (1965), 149–175.

    Article  MATH  MathSciNet  Google Scholar 

  6. A.R. Smith III, Simple computation universal cellular spaces, J. Assoc. Computing Machinery 18 (1971), 339–353.

    MATH  Google Scholar 

  7. S. Wolfram (ed.), “Theory and Applications of Cellular Automata,” World Scientific, Singapore, 1986.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of South Florida, 33620-5700, Tampa, FL, USA

    John Pedersen

Authors
  1. John Pedersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pedersen, J. (1992). Decision problems for cellular automata and their semigroups. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation