Automorphism groups of context-free graphs

DOI10.1016/0304-3975(96)00222-8zbMath0872.68138OpenAlexW1998600057MaRDI QIDQ671518

Laurent Pélecq

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00222-8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

The language of self-avoiding walks ⋮ Context-free pairs of groups. I: Context-free pairs and graphs ⋮ Logical aspects of Cayley-graphs: the group case

Cites Work

• Groups, the theory of ends, and context-free languages
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs
• The theory of ends, pushdown automata, and second-order logic
• Infinite hypergraphs. II: Systems of recursive equations
• Infinite hypergraphs. I: Basic properties
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automorphism groups of context-free graphs