Advertisement

On cellular graph-automata and second-order definable graph-properties

  • Gy. Turán
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Angluin: Local and global properties in networks of processors Proc. 12. ACM Symp. on Th. of Comp., Los Angeles, 1980. pp. 82–93.Google Scholar
  2. [2]
    Demoucron-Malgrange-Pertuiset: Graphes plein-airs, reconnaissance et construction des representations planaires topologiques, R. Fr. R. Op., 1964, pp. 33–47.Google Scholar
  3. [3]
    R.E. Ladner: Application of model theoretic games to discrete linear orders and finite automata, Inf. and Cont., 1977, pp. 281–303.Google Scholar
  4. [4]
    Rosentiehl-Fiksel-Holliger: Intelligent graphs, Graph Theory and Computing, Ac. Press, 1972. pp. 219–265.Google Scholar
  5. [5]
    Turán Gy.: Gráf-tulajdonságok lokális felismerhetőségéről és definiälhatóságáról, Thesis. Szeged, 1980.Google Scholar
  6. [6]
    A. Wu-A. Rosenfeld: Cellular graph-automata I–II. Inf. and Cont., 1979, pp. 305–353.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Gy. Turán
    • 1
  1. 1.Research Group on the Theory of AutomataSzeged

Personalised recommendations