Automorphism groups of context-free graphs
type: Item
instance of: scholarly article
title: Automorphism groups of context-free graphs
zbMATH Open document ID: 0872.68138
DOI: 10.1016/0304-3975(96)00222-8
author: Laurent Pélecq
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 983348
MaRDI profile type: Publication
full work available at URL: 0304-3975(96)00222-8
OpenAlex ID: W1998600057
cites work: Q5652216
cites work: Infinite hypergraphs. I: Basic properties
cites work: Infinite hypergraphs. II: Systems of recursive equations
cites work: Q4027621
cites work: The monadic second-order logic of graphs, II: Infinite graphs of bounded width
cites work: The monadic second-order logic of graphs. IV: Definability properties of equational graphs
cites work: Q4385531
cites work: Groups, the theory of ends, and context-free languages
cites work: The theory of ends, pushdown automata, and second-order logic
Recommended article: Q3320418
Recommended article: Q5278466
Recommended article: Q2933608
Recommended article: Graph automaton groups
Recommended article: Automorphism groups of covering graphs
Recommended article: On Graphs Representing Automorphisms of Free Groups
Recommended article: Automorphism groups of some generalized Cayley graphs
Recommended article: The automorphism group of a graphon
Recommended article: Automaticity for graphs of groups
Recommended article: Q2933601
description: scientific article; zbMATH DE number 983348