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