Ambiguity in Omega Context Free Languages

Olivier Finkel (1)

1 ELM - Équipe de Logique Mathématique

We extend the well known notions of ambiguity and of degrees of ambiguity of finitary context free languages to the case of omega context free languages (omega-CFL) accepted by Büchi or Muller pushdown automata. We show that these notions may be defined independantly of the Büchi or Muller acceptance condition which is considered. We investigate first properties of the subclasses of omega context free languages we get in that way, giving many examples and studying topological properties of omega-CFL of a given degree of ambiguity.

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]

Olivier Finkel. Ambiguity in Omega Context Free Languages. Theoretical Computer Science, 2003, 301 (1-3), pp.217-270. ⟨hal-00104187⟩