Fine hierarchy of regular ω-languages

DOI10.1007/3-540-59293-8_201zbMath1496.68181OpenAlexW30912922MaRDI QIDQ5096737

Victor L. Selivanov

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_201

Mathematics Subject Classification ID

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

Related Items (5)

Towards a descriptive set theory for domain-like structures ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ On the main scientific achievements of Victor Selivanov ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

Cites Work

• Hierarchies of hyperarithmetical sets and functions
• Descriptive set theory
• Fine hierarchy and definable index sets
• On ω-regular sets
• Fine hierarchies and Boolean terms
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fine hierarchy of regular ω-languages