A classification of &ohgr;-regular languages
Theoretical Computer Science
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Handbook of theoretical computer science (vol. B)
The Hausdorff-Kuratowski hierarchy of &ohgr;-regular languages and a hierarchy of Muller automata
Theoretical Computer Science
The Borel hierarchy is infinite in the class of regular sets of trees
Theoretical Computer Science
Theoretical Computer Science
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Fine hierarchy of regular &ohgr;-languages
Theoretical Computer Science
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
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
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
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
Ambiguity in omega context free languages
Theoretical Computer Science
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
On the length of the Wadge hierarchy of ω-context-free languages
Journal of Automata, Languages and Combinatorics
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
The wadge hierarchy of deterministic tree languages
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
There exist some ω-powers of any Borel rank
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Hi-index | 5.23 |
We give in this paper additional answers to questions of Lescow and Thomas (A decade of Concurrency, Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1994, pp. 583-621), proving topological properties of omega context free languages (ω-CFL) which extend those of O. Finkel (Theoret. Comput. Sci. 262 (1-2) (2001) 669-697): there exist some ω-CFL which are non Borel sets and one cannot decide whether an ω-CFL is a Borel set. We give also an answer to a question of Niwinski (Problem on ω-Powers Posed in the Proceedings of the Workshop "Logics and Recognizable Sets, 1990") and of Simonnet (Automates et Thérie Descriptive, Ph.D. Thesis, Université Paris 7, 1992) about ω-powers of finitary languages, giving an example of a finitary context free language L such that Lω is not a Borel set. Then we prove some recursive analogues to preceding properties: in particular one cannot decide whether an ω-CFL is an arithmetical set. Finally we extend some results to context free sets of infinite trees.