Skip to main content
SpringerLink
Log in

An introduction to automata network theory

  • Conference paper
  • First Online:
Automata Networks (LITP 1986)

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

Included in the following conference series:

  • 196 Accesses

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.

6. References

  1. ALLOUCHE J.P. & C. REDER, Oscillations Spatio-temporelles engendrées par un Automate Cellulaire, Applied Discrete Math., 8,1985, p.215–254.

    Google Scholar 

  2. BERLEKAMP E.R., CONWAY J.H. & R.K. GUY, "Winning ways", Academic Press, (1982)

    Google Scholar 

  3. BERSTEL J., Quelques applications des réseaux d'automates à des problèmes de la théorie des graphes, Thèse de 3è II e cycle, Paris, (1967)

    Google Scholar 

  4. BURKS A.W., "Essays on Cellular Automata", University of Illinois Press, A.W. BURKS Ed., (1970).

    Google Scholar 

  5. CODD E.F., "Cellular Automata", Academic Press, (1968).

    Google Scholar 

  6. COLE S.N., Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. Comput., 18, (1969) pp349–365.

    Google Scholar 

  7. GREENBERG J.M. et al., A combinatorial problem arising in the study of reaction-diffusion equations, Siam J. Alg. Disc. Meth., (1980).

    Google Scholar 

  8. GUIBAS L.J & F.M.LIANG, Syustolic Stacks, Queues, and Counters, Conférences on Advanced Research in VLSI (1982), pp. 155–164.

    Google Scholar 

  9. HEDLUND G.A., Endomorphisms and automorphisms of the shift dynamical system, Math. System Theory, 3, (1969), pp. 320–375.

    Google Scholar 

  10. HENNIE F.C., Iterative Arrays of Logical Circuits, Cambridge MA: MIT Press, (1961).

    Google Scholar 

  11. KUNG H.T., in "Introduction to VLSI", MEAD C. & L. CONWAY, Addison Wesley, (1980).

    Google Scholar 

  12. LEISERSON C.E. & J.B. SAXE, Optimizing Synchronous Systems, in Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, IEEE Computer Science, (1981), pp.23–36.

    Google Scholar 

  13. ROSENSTIEHL P., Intelligent graphs: Networks of finite automata capable of solving graph problems, in "Graph Theory and Computing", Academic Press, (1972)

    Google Scholar 

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

    Google Scholar 

  15. Von NEUMANN J., "Theory of Self-Reproducing Automata", A.W. Burks Ed., University of Urbana Press, (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, Universite De Rouen, 76113, Mont-Saint-Aignan

    Christian Choffrut

Authors
  1. Christian Choffrut
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Choffrut

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choffrut, C. (1988). An introduction to automata network theory. In: Choffrut, C. (eds) Automata Networks. LITP 1986. Lecture Notes in Computer Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19444-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-19444-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19444-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation