Download:
|
by Universit'e De Bordeaux I
http://www.labri.fr/Labri/Publications/Rapports-internes/RR-109495.ps.Z
Add To MetaCart
Abstract:
Abstract. Let \Gamma be some context-free graph. We give sufficient conditions on a semi-group of bisimulations H ensuring that the quotient Hn\Gamma is context-free. Using these sufficient conditions we show that the quotient Aut(\Gamma)n\Gamma of \Gamma by its full group of automorphisms is always context-free. We then give examples showing optimality (in some sense) of the above result.
Citations
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
187
|
Transductions and Context-Free Languages
– Berstel
- 1979
|
|
186
|
Graph rewriting: An algebraic and logic approach
– Courcelle
- 1990
|
|
98
|
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
– Baeten, Bergstra, et al.
- 1993
|
|
96
|
The theory of ends, pushdown automata, and second-order logic’, Theoret
– Muller, Schupp
- 1985
|
|
90
|
Bisimulation Equivalence is Decidable for all Context-Free Processes
– Christensen, Hüttel, et al.
- 1992
|
|
67
|
On the regular structure of prefix rewriting
– Caucal
- 1992
|
|
40
|
Groups, the theory of ends, and context-free languages
– Muller, Schupp
- 1983
|
|
38
|
Groups acting on graphs
– Dicks, Dunwoody
- 1989
|
|
34
|
A polynomial algorithm for deciding bisimilarity of normed context-free processes
– Hirshfeld, Jerrum, et al.
- 1996
|
|
25
|
The monadic second-order logic of graphs II: Infinite graphs of bounded width
– Courcelle
|
|
24
|
Group-theoretic algorithms and graph isomorphism, volume 136
– Hoffmann
- 1982
|
|
23
|
Synchronized ratio-nal relations of finite and infinite words. Theoretical Comp. Sc
– Frougny, Sakarovitch
- 1993
|
|
14
|
Graphes canoniques de graphes alg'ebriques
– Caucal
- 1990
|
|
13
|
Bisimulation of context-free grammars and of pushdown automata
– Caucal
- 1995
|
|
8
|
Automorphisms and endomorphisms of infinite locally finite graphs
– Halin
- 1973
|
|
6
|
Infinite hypergraph I, basic properties (fundamental study
– Bauderon
- 1991
|
|
6
|
Infinite hypergraphs II. Systems of recursive equations
– Bauderon
- 1992
|
|
5
|
The monadic second-order logic of graphs IV: definability properties of equational graphs
– Courcelle
- 1990
|
|
3
|
Group languages
– Anisimov
- 1971
|
|
1
|
collection ast'erisque, nr 46
– Arbres, SMF
- 1983
|
|
1
|
Abr'eg'e d'histoire des math'ematiques, tomes I et II
– Dieudonn'e
- 1978
|
|
1
|
Automorphism groups of context-free graphs. Accepted for publication
– Pelecq
- 1995
|
|
1
|
Graphes context-free. Notes de cours de DEA de l'universit'e de Bordeaux 1
– S'enizergues
- 1989
|
|
1
|
The isomorphism problem for the transition-graphs of pushdown automata. Talk given at FAIT 89
– S'enizergues
- 1989
|
