Skip to main content
SpringerLink
Log in

On real-time cellular automata and trellis automata

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

It is shown that f(n)-time one-way cellular automata are equivalent to f(n)-time trellis automata, the real-time one-way cellular automata languages are closed under reversal, the 2n-time one-way cellular automata are equivalent to real-time cellular automata and the latter are strictly more powerful than the real-time one-way cellular automata.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beyer, W.T.: Recognition of Topological Invariants by Iterative Arrays, MACTR-66, Massachusetts, Institute of Technology, 1969

    Google Scholar 

  2. Culik, K. II, Gruska, J., Salomaa, A.: Systolic trellis automata (for VLSI). Res. Rep. CS-81-34, Dept. of. Comput. Sci., University of Waterloo, 1981

  3. Culik, K. II, Gruska, J., Salomaa, A.: Systolic trellis automata: Stability, Decidability and Complexity. Res. Rep. CS-82-04, Dept. of Comput. Sci., University of Waterloo, 1982

  4. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of fine-state machines. IEEE Trans. Comput. 18, 349–365 (1969)

    Google Scholar 

  5. Culik, K. II, Pachl, J.: Folding and Unrolling Systolic Arrays. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, August 1982

  6. Dyer, C.R.: One Way Bounded Cellular Automata. Information and Control 44, 261–281 (1980)

    Google Scholar 

  7. Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. Assoc. Comput. Mach. 12, 388–394 (1965)

    Google Scholar 

  8. Hennie, F.C.: Iterative Arrays of Logical Circuits. Cambridge MA: MIT Press 1961

    Google Scholar 

  9. Kosaraju, S.P.: On some open problems in the theory of cellular automata, IEEE Trans. Comput. C-23, 561–565 (1974)

    Google Scholar 

  10. Kung, H.T.: Why Systolic Architecture? Computer Magazin, January 1982

  11. Leiserson, C.E., Saxe, J.B.: Optimizing Synchronous Systems. In: Proceedings of the 22nd Annual Symposium on Foundations of Computer Science. IEEE Computer Science, pp. 23–36, 1981

  12. Smith, A.R., III: Cellular automata and formal languages. In: Proc. 11th IEEE Ann. Symp. Switching Automata Theory, pp. 216–224, 1970

  13. Smith, A.R., III: Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6, 233–253 (1972)

    Google Scholar 

  14. Umeo, H., Morita, K., Sugata, K.: Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Information Processing Lett. 14, 158–161 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U.E.R. de Mathématiques, Université Paris 7, Tours 55-56, 2 Pl. Jussieu, F-75221, Paris Cedex 05, France

    C. Choffrut

  2. Department Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    K. Culik II

Authors
  1. C. Choffrut
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Culik II
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been done during the second author's visit at the University of Paris and during both authors' visit at the Institute für Informationsverarbeitung Graz, Austria

Rights and permissions

Reprints and permissions

About this article

Cite this article

Choffrut, C., Culik, K. On real-time cellular automata and trellis automata. Acta Informatica 21, 393–407 (1984). https://doi.org/10.1007/BF00264617

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264617

Keywords

Search

Navigation