Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Node replacement graph grammars
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Graphic Apology for Symmetry and Implicitness
Graphic Apology for Symmetry and Implicitness
Word Processing in Groups
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Mathematical Theory of L Systems
Mathematical Theory of L Systems
An Effective Version of Stallings' Theorem in the Case of Context-Free Groups
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Parallel Generation of Maps: Developmental Systems for Cell Layers
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Algorithms for the generation and drawing of maps representing cell clones
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
An introduction to parallel map generating systems
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
The concept of end is a classical mean of understanding the behavior of a graph at infinity. In this respect, we show that the problem of deciding whether an infinite automatic graph has more than one end is recursively undecidable. The proof is based on the analysis of some global topological properties of the configuration graph of a self-stabilizing Turing machine. Next, this result is applied to show the undecidability of connectivity of all the finite graphs produced by iterating a graph DOL-system. We also prove that the graph DOL-systems with which we deal can emulate hyperedge replacement systems for which the above connectivity problem is decidable.