Languages versus -languages in regular infinite games

DOI10.1142/S0129054112400412zbMATH Open1262.68087OpenAlexW2048271984MaRDI QIDQ4902889FDOQ4902889

Authors Namit Chaturvedi, J. Olschewski, Wolfgang Thomas 

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

regular languagesinfinite gamesstar-free languageswinning strategies

Mathematics Subject Classification ID

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

Recommendations

• Languages vs. \(\omega \)-languages in regular infinite games
• Strategical languages of infinite words
• An infinite game over \(\omega\)-semigroups.
• scientific article; zbMATH DE number 2077117
• Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies

Cites work

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

Cited in

(5)

• An application of the Ehrenfeucht-Fraisse game in formal language theory
• Playing with subshifts
• scientific article; zbMATH DE number 7770056 (Why is no real title available?)
• scientific article; zbMATH DE number 4039871 (Why is no real title available?)
• Languages vs. \(\omega \)-languages in regular infinite games

This page was built for publication: Languages versus \(\omega\)-languages in regular infinite games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902889)