This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin: Local and global properties in networks of processors Proc. 12. ACM Symp. on Th. of Comp., Los Angeles, 1980. pp. 82–93.
Demoucron-Malgrange-Pertuiset: Graphes plein-airs, reconnaissance et construction des representations planaires topologiques, R. Fr. R. Op., 1964, pp. 33–47.
R.E. Ladner: Application of model theoretic games to discrete linear orders and finite automata, Inf. and Cont., 1977, pp. 281–303.
Rosentiehl-Fiksel-Holliger: Intelligent graphs, Graph Theory and Computing, Ac. Press, 1972. pp. 219–265.
Turán Gy.: Gráf-tulajdonságok lokális felismerhetőségéről és definiälhatóságáról, Thesis. Szeged, 1980.
A. Wu-A. Rosenfeld: Cellular graph-automata I–II. Inf. and Cont., 1979, pp. 305–353.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turán, G. (1981). On cellular graph-automata and second-order definable graph-properties. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_42
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive