See this document in CiteSeerX!

Semi-Groups Acting on Context-Free Graphs  (Make Corrections)  
Géraud Sénizergues



  Home/Search   Context   Related

 
View or download:
labri.fr/Labri/Publica...RR109495.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  labri.fr/Labri/Pub...Publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. Keywords: infinite graphs; ends; pushdown automata; automorphisms; bisimulations; groups; semi-groups. 1 (Update)

Active bibliography (related documents):   More   All
3.7:   Semi-Groups Acting on Context-Free Graphs - Sénizergues   (Correct)
1.2:   Gamma(A) \equiv Gamma(B)? - Senizergues (1997)   (Correct)
0.5:   Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996)   (Correct)

Similar documents based on text:   More   All
0.3:   L(A)=L(B)? yet another decidability proof. - Sénizergues   (Correct)
0.3:   Free Group Languages: Rational Versus Recognizable - Silva (2001)   (Correct)
0.2:   Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ nizergues-semigroups,
  author = "Géraud Sénizergues",
  title = "Semi-Groups Acting on Context-Free Graphs",
  url = "citeseer.ist.psu.edu/573059.html" }
Citations (may not include all citations):
502   Concurrency and automata on infinite sequences (context) - Park - 1981
327   Languages and Machines (context) - Eilenberg - 1974
113   Decidability of bisimulation equivalence for processes gener.. (context) - Baeten, Bergstra et al. - 1987
102   Bisimulation equivalence is decidable for all context-free p.. - Christensen, Huttel et al. - 1992
48   the regular structure of prefix rewritings (context) - Caucal - 1990
39   A polynomial algorithm for deciding bisimilarity of normed c.. - Hirshfeld, Jerrum et al. - 1994
29   Group-theoretic algorithms and graph-isomorphism (context) - Hoffmann - 1982
26   Graphes canoniques de graphes alg'ebriques (context) - Caucal - 1990
24   Groups acting on graphs (context) - Dicks, Dunwoody - 1990
18   Synchronized rational relations of finite and infinite words (context) - Frougny, Sakarovitch - 1993
13   pushdown automata and second-order logic (context) - Muller, Schupp et al. - 1985
11   Bisimulation of context-free grammars and of pushdown automa.. - Caucal - 1995
11   The monadic second-order logic of graphs ii: infinite graphs.. (context) - Courcelle - 1989
5   Context-free languages (context) - Berstel, Boasson - 1991
5   The monadic second-order logic of graphs IV: definability pr.. (context) - Courcelle - 1990
5   Infinite hypergraph (context) - Bauderon - 1991
5   the theory of ends and context-free languages (context) - Muller, Schupp - 1983
5   systems of recursive equations (context) - Bauderon - 1992
4   Automorphism groups of context-free graphs (context) - Pelecq - 1995
3   Graph rewriting: and algebraic and logic approach (context) - Courcelle - 1990
3   Automorphisms and endomorphisms of infinite locally finite g.. (context) - Halin - 1973
3   Group languages (context) - Anisimov - 1971
2   Notes de cours de DEA de l'universit'e de Bordeaux (context) - S'enizergues - 1989
2   collection ast'erisque (context) - Bass, Serre et al. - 1983
1   The isomorphism problem for the transition-graphs of pushdow.. (context) - S'enizergues - 1989
1   Abr'eg'e d'histoire des math'ematiques (context) - Dieudonn'e - 1978

Documents on the same site (http://www.labri.fr/Labri/Publications/Rapports-internes/Publications.htm):   More
Toupie User's Manual - Corsini, Rauzy   (Correct)
Sand Piles in Digraphs - Durand-Lose (1996)   (Correct)
Enumerating Alternating Trees - Chauve, Dulucq, Rechnitzer (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC