LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES

DOI10.1142/S0129054112400412zbMath1262.68087OpenAlexW2048271984MaRDI QIDQ4902889

Wolfgang Thomas, J. Olschewski, Namit Chaturvedi

Publication date: 18 January 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400412

zbMATH Keywords

infinite gamesregular languagesstar-free languageswinning strategies

Mathematics Subject Classification ID

2-person games (91A05) Formal languages and automata (68Q45) Logic in computer science (03B70)

Related Items (1)

Unnamed Item

Cites Work

• Characterizations of some classes of regular events
• First-order logic and star-free sets
• Classifying regular events in symbolic logic
• Dot-depth of star-free events
• FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
• Logical Refinements of Church’s Problem
• A combinatorial approach to the theory of ω-automata
• Languages vs. ω-Languages in Regular Infinite Games
• Fine Hierarchy of Regular Aperiodic ω-Languages
• Church’s Problem and a Tour through Automata Theory

This page was built for publication: LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES