Abstract
The formalism of graph automata is presented. The notion of neighborhood vector is especially described. Afterwards, graph automata and classical cellular automata are compared.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cole S. Real-time computation by n-dimensional iterative arrays of finite-state machine IEEE Trans. Comput. Vol. no. C-18: 349–365, 1969.
Rdka Zs. Automates cellulaires sur les graphes de Cayley Ph.D Thesis, Université Lyon I et Ecole Normale Supérieure de Lyon, 1994.
Rosenstieh1 P. Existence d’automates finis capables de s’accorder bien qu’arbritrairement connectés et nombreux. Internat. Comp. Centre Vol. no. 5: 245–261, 1966.
Rosenstiehl P., Fiksel J.R. and Holliger A. Intelligent graphs: Networks of finite automata capable of solving graph problems. R.ed R. C., Ed, Graph Theory and computing, Academic Press, New York 210–265, 1973.
Wu A. and Rosenfeld A. Cellular graph automata I. Information and Control Vol. no. 42: 305–328, 1979
Wu A. and Rosenfeld A. Cellular graph automata II. Information and Control Vol. no. 42: 330–353, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Rémila, E. (1999). An Introduction to Automata on Graphs. In: Delorme, M., Mazoyer, J. (eds) Cellular Automata. Mathematics and Its Applications, vol 460. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9153-9_15
Download citation
DOI: https://doi.org/10.1007/978-94-015-9153-9_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5143-1
Online ISBN: 978-94-015-9153-9
eBook Packages: Springer Book Archive