An introduction to automata network theory

  • Christian Choffrut
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 316)


Cellular Automaton Computable Function Finite Automaton Systolic Array Outgoing Edge 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [Al]
    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. [Be]
    BERLEKAMP E.R., CONWAY J.H. & R.K. GUY, "Winning ways", Academic Press, (1982)Google Scholar
  3. [Ber]
    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. [Bu]
    BURKS A.W., "Essays on Cellular Automata", University of Illinois Press, A.W. BURKS Ed., (1970).Google Scholar
  5. [Co]
    CODD E.F., "Cellular Automata", Academic Press, (1968).Google Scholar
  6. [Col]
    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. [Gr]
    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. [Gui]
    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. [He]
    HEDLUND G.A., Endomorphisms and automorphisms of the shift dynamical system, Math. System Theory, 3, (1969), pp. 320–375.Google Scholar
  10. [Hen]
    HENNIE F.C., Iterative Arrays of Logical Circuits, Cambridge MA: MIT Press, (1961).Google Scholar
  11. [Ku]
    KUNG H.T., in "Introduction to VLSI", MEAD C. & L. CONWAY, Addison Wesley, (1980).Google Scholar
  12. [Le]
    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. [Ro]
    ROSENSTIEHL P., Intelligent graphs: Networks of finite automata capable of solving graph problems, in "Graph Theory and Computing", Academic Press, (1972)Google Scholar
  14. [Sm]
    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]
    Von NEUMANN J., "Theory of Self-Reproducing Automata", A.W. Burks Ed., University of Urbana Press, (1966).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Christian Choffrut
    • 1
  1. 1.Laboratoire d'InformatiqueUniversite De RouenMont-Saint-Aignan

Personalised recommendations