Abstract
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 (ω-CFL) accepted by Büchi or Muller pushdown automata. We show that these notions may be defined independently 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 ω-CFL of a given degree of ambiguity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
