Ambiguity in omega context free languages

Authors:
Olivier Finkel
Affiliations:
Equipe de Logique Mathématique, CNRS et Université Paris 7, U.F.R. de Mathématiques, 2 Place Jussieu, 75251 Paris cedex 05, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 19
Cited 3

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
X-automata on &ohgr;-words

Theoretical Computer Science
Pushdown automata with bounded nondeterminism and bounded ambiguity

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
&ohgr;-languages

Handbook of formal languages, vol. 3
Fine hierarchy of regular &ohgr;-languages

Theoretical Computer Science
Ambiguity in context free languages

Journal of the ACM (JACM)
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language

Journal of the ACM (JACM)
Computer science and the fine structure of Borel sets

Theoretical Computer Science
Topological properties of omega context-free languages

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Topological Characterizations of Infinite Behaviours of Transition Systems

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Logical Specifications of Infinite Computations

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Borel hierarchy and omega context free languages

Theoretical Computer Science
On omega context free languages which are Borel sets of infinite rank

Theoretical Computer Science
Formal languages and their relation to automata

Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

On Effective Methods for Diagnosis of Retaining Faults in Circuits

Fundamenta Informaticae
On Recognizable Tree Languages Beyond the Borel Hierarchy

Fundamenta Informaticae
On Winning Conditions of High Borel Complexity in Pushdown Games

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

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.