A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Ambiguity in omega context free languages
2003
Theoretical Computer Science
We extend the well-known notions of ambiguity and of degrees of ambiguity of ÿnitary context free languages to the case of omega context free languages (!-CFL) accepted by B uchi or Muller pushdown automata. We show that these notions may be deÿned independently of the B uchi or Muller acceptance condition which is considered. We investigate ÿrst properties of the subclasses of omega context free languages we get in that way, giving many examples and studying topological properties of !-CFL of
doi:10.1016/s0304-3975(02)00584-4
fatcat:zohu57u5t5dzrh6yjhpiqdf2pe