On omega context free languages which are Borel sets of infinite rank.

DOI10.1016/S0304-3975(02)00327-4zbMath1051.68093MaRDI QIDQ1874398

Olivier Finkel

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Borel hierarchyTopological propertiesOmega context free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)

Related Items (1)

Ambiguity in omega context free languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification of \(\omega\)-regular languages
• Fine hierarchy of regular \(\omega\)-languages
• Descriptive set theory
• Adherences of languages
• The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata
• \(X\)-automata on \(\omega\)-words
• The monadic second order theory of all countable ordinals
• A decidability result for deterministic \(\omega\)-context-free languages
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• \(\omega\)-computations on deterministic pushdown machines
• A hierarchy of deterministic context-free \(\omega\)-languages.
• Borel hierarchy and omega context free languages.
• Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
• Weak Second‐Order Arithmetic and Finite Automata
• On ω-regular sets
• On ω-sets associated with context-free languages
• Chains and Superchains for ω-Rational Sets, Automata and Semigroups
• THE WAGNER HIERARCHY
• Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
• Solving Sequential Conditions by Finite-State Strategies
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Developments in Language Theory
• Computer science and the fine structure of Borel sets
• Topological properties of omega context-free languages
• Wadge hierarchy of omega context-free languages

This page was built for publication: On omega context free languages which are Borel sets of infinite rank.