Logic vs topology on regular \(\omega \)-languages

DOI10.1007/978-3-031-36978-0_12OpenAlexW4384788254MaRDI QIDQ6149039

Victor L. Selivanov, Vladislav Orekhovskii

Publication date: 12 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-36978-0_12

zbMATH Keywords

Wadge hierarchyBoolean operationfine hierarchyWagner hierarchyregular \(\omega \)-language

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchies of hyperarithmetical sets and functions
• Fine hierarchies and m-reducibilities in theoretical computer science
• Fine hierarchy of regular \(\omega\)-languages
• Topology and descriptive set theory
• FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
• Hierarchies and reducibilities on regular languages related to modulo counting
• On ω-regular sets
• Star-free regular sets of ω-sequences
• Fine hierarchies and Boolean terms
• Decision problems forω-automata
• Automata theory and its applications

This page was built for publication: Logic vs topology on regular \(\omega \)-languages