Automatic graphs and D0L-sequences of finite graphs
DOI10.1016/S0022-0000(03)00065-5zbMath1114.68048OpenAlexW2008686032MaRDI QIDQ1877692
Publication date: 19 August 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00065-5
Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Directed graphs (digraphs), tournaments (05C20) Turing machines and related notions (03D10)
Related Items (2)
Cites Work
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
- The theory of ends, pushdown automata, and second-order logic
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Representing graph families with edge grammars
- Handle-rewriting hypergraph grammars
- Über unendliche Wege in Graphen
- On torsion-free groups with infinitely many ends
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Handbook of Graph Grammars and Computing by Graph Transformation
- An effective version of Stallings' theorem in the case of context-free groups
- The undecidability of the Turing machine immortality problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automatic graphs and D0L-sequences of finite graphs
