Advertisement

Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods

  • Martin Delacourt
  • Victor Poupet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4708)

Abstract

In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearly equivalent we focus on a natural sub-linear complexity class: the real time.

We show that any complete neighborhood is sufficient to recognize in real time any language that can be recognized in real-time by a cellular automaton working on the convex hull of V.

Keywords

Convex Hull Cellular Automaton Neighborhood Versus Input Word Language Recognition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, J., Čulik II, K.: A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1, 1–16 (1987)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers C-18, 349–365 (1969)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Čulik, K., Hurd, L.P., Yu, S.: Computation theoretic aspects of cellular automata. Phys. D 45, 357–378 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Dyer, C.R.: One-way bounded cellular automata. Information and Control 44, 261–281 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Ibarra, O., Jiang, I.: Relating the power of cellular arrays to their closure properties. Theoretical Computer Science 57, 225–238 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Ibarra, O.: 6. In: Cellular Automata: a Parallel Model, Mathematics and its applications edn., pp. 181–197. Kluwer, Dordrecht (1999)Google Scholar
  7. 7.
    Poupet, V.: Cellular automata: Real-time equivalence between one-dimensional neighborhoods. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 133–144. Springer, Heidelberg (2005)Google Scholar
  8. 8.
    Smith III, A.R.: Simple computation-universal cellular spaces. J. ACM 18, 339–353 (1971)zbMATHCrossRefGoogle Scholar
  9. 9.
    Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. Journal of the Assoc. Comput. Mach. 6, 233–253 (1972)zbMATHGoogle Scholar
  10. 10.
    Terrier, V.: Language recognizable in real time by cellular automata. Complex Systems 8, 325–336 (1994)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Terrier, V.: Language not recognizable in real time by one-way cellular automata. Theoretical Computer Science 156, 281–287 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Terrier, V.: Two-dimensional cellular automata recognizer. Theor. Comput. Sci. 218, 325–346 (1999)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Martin Delacourt
    • 1
  • Victor Poupet
    • 1
  1. 1.LIP (UMR 5668 — CNRS, ENS Lyon, UCB Lyon, INRIA), ENS Lyon, 46 allée d’Italie, 69364 LYON cedex 07France

Personalised recommendations