Automatic graphs and graph D0L-systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 539-548

  Ly, Olivier ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TURING MACHINES;

CONNECTIVITY PROBLEMS; D0L SYSTEM; FINITE GRAPHS; GLOBAL TOPOLOGICAL PROPERTIES; HYPEREDGE REPLACEMENT; UNDECIDABILITY;

TOPOLOGY;

EID: 84959218249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_49     Document Type: Conference Paper

References (35)

1. L. W. Ahlfors and L. Sario. Riemann Surfaces. Princeton University Press, 1960.
2. A. Blumensath and E. Gradel. Automatic structures. In LICS'2000, 2000.
3. A. Carbonne and S. Semmes. A graphic apology for symmetry and implicitness. Preprint.
4. A. Clow and S. Billington. Recognizing Two-Ended and Infinitely Ended Automatic Groups. Computer Program, Warwick University - UK, 1998.
5. B. Courcelle. Fundamental Properties of Infinite Trees. Theoretical Computer Science, 25:95-169, 1983.
6. B. Courcelle. Graph Rewriting: An algebraic and Logic Approach. In Handbook of Theoretical Computer Science vol. B, Van Leeuwen J. editor. Elsevier Science Publishers, 1990.
7. B. Courcelle. The Monadic Second-order Logic of Graphs IV: Definability Properties of Equational Graphs. Annals of Pure and Applied Logic, 49:193-255, 1990.
8. B. Courcelle. The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1. World Scientific, 1997.
9. B. Courcelle and J. Engelfriet. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Syst. Theory, 28(6):515-552, 1995.
10. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle Rewriting Hypergraph Grammars. JCSS, 46:218-270, 1993.
11. M. De Does and A. Lindenmayer. Algorithms for the Generation and Drawing of Maps Representing Cell Clones. In GGACS'82, volume 153 of Lect. Notes in Comp. Sci, pages 39-57. Springer-Verlag, 82.
12. W. Dicks and M.J. Dunwoody. Groups Acting on Graphs, volume 17 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1989.
13. J. Engelfriet and G. Rozenberg. Node Replacement Graph Grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1. World Scientific, 1997.
14. D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson, and W.P. Thurston. Word processing in groups. Jones and Bartlett, 1992.
15. V. Gerasimov. Detecting Connectedness of the Boundary of a Hyperbolic Group. Preprint, 1999.
16. E. Ghys and P. de la Harpe. Sur les groupes hyperboliques d'apres Mikhael Gromov, volume 83 of Progress in Mathematics. Birkhauser, 1990.
17. R. Haiin. "Über Unendliche Wege in Graphen. Math. Ann., 157:125-137, 1964.
18. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, 1979.
19. B. Khoussainov and A. Nerode. Automatic Presentations of Structures. In Logic and Computational Complexity (Indianapolis, IN, 1994), volume 960 of Lecture Notes in Comput. Sci, pages 367-392. Springer, Berlin, 1995.
20. A. Lindenmayer. An Introduction to Parallel Map Generating Systems. In GGACS'86, volume 291 of Lect. Notes in Comp. Sci., pages 27-40. Springer-Verlag, 1986.
21. A. Lindenmayer and G. Rozenberg. Parallel generation of maps: developmental systems systems for cell layers. In GGACS'78, volume 73 of Lect. Notes in Comp. Sci., pages 301-316. Springer-Verlag, 1978.
22. O. Ly. On Effective Decidability of the Homeomorphism Problem for Non-Compact Surfaces. Contemporary Mathematics - Amer. Math. Soc., 250:89-112, 1999.
23. W. S. Massey. Algebraic Topology: An Introduction, volume 56 of Graduate Text in Mathematics. Springer, 1967.
24. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51-75, 1985.
25. P. Narbel. Limits and Boundaries of Word and Tiling Substitutions. PhD thesis, Paris 7, 1993.
26. C.H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
27. L. Pelecq. Isomorphisme et automorphismes des graphes context-free, equationnels et automatiques. PhD thesis, Bordeaux I, 1997.
28. J. Peyriere. Processus de naissance avec interaction des voisins, evolution de graphes. Ann. Inst. Fourier, Grenoble, 31(4):181-218, 1981.
29. J. Peyriere. Frequency of patterns in certain graphs and in Penrose tilings. Journal de Physique, 47:41-61, 1986.
30. N. Robertson and P. Seymour. Some New Results on the Well-Quasi Ordering of Graphs. Annals of Dicrete Math., 23:343-354, 1984.
31. G. Rozenberg. Handbook of Graph Grammars and Computing by Graph Transformation, volume 1. World Scientific, 1997.
32. G. Rozenberg and A. Salomaa. The Mathematical Theory of L-Systems. Academic Press, 1980.
33. G. Senizergues. Definability in weak monadic second-order logic of some infinite graphs. In Dagstuhl seminar on Automata theory: Infinite computations. Wadern, Germany, volume 28, pages 16-16, 1992.
34. G. Senizergues. An effective version of Stallings' theorem in the case of context-free groups. In ICALP'93, pages 478-495. Lect. Notes Comp. Sci. 700, 1993.
35. J.R. Stallings. On torsion-free groups with infinitely many ends. Ann. of Math., 88:312-334, 1968.