Automatic graphs and D0L-sequences of finite graphs
DOI10.1016/S0022-0000(03)00065-5zbMATH Open1114.68048OpenAlexW2008686032MaRDI QIDQ1877692FDOQ1877692
Authors: Olivier Ly 
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
Recommendations
- Cayley graphs and automatic sequences
- scientific article; zbMATH DE number 1759440
- On automatic transitive graphs
- Automaticity of ordinals and of homogeneous graphs
- scientific article; zbMATH DE number 3843804
- scientific article; zbMATH DE number 7604432
- scientific article; zbMATH DE number 7268038
- Automaticity for graphs of groups
- scientific article; zbMATH DE number 3847421
- scientific article; zbMATH DE number 139736
Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Handle-rewriting hypergraph grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of Graph Grammars and Computing by Graph Transformation
- Title not available (Why is that?)
- On torsion-free groups with infinitely many ends
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- The undecidability of the Turing machine immortality problem
- Über unendliche Wege in Graphen
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
- The theory of ends, pushdown automata, and second-order logic
- Title not available (Why is that?)
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- An effective version of Stallings' theorem in the case of context-free groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representing graph families with edge grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Automatic graphs and D0L-sequences of finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877692)
