Topological complexity of locally finite \(\omega\)-languages

DOI10.1007/S00153-008-0101-7zbMath1145.03018OpenAlexW2153459383MaRDI QIDQ944222

Olivier Finkel

Publication date: 12 September 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0101-7

zbMATH Keywords

analytic setstopological complexityBorel hierarchylocal sentenceslocally finite omega-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 (2)

Locally finite languages ⋮ Locally finite ω-languages and effective analytic sets have the same topological complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On decidability properties of local sentences
• A logical approach of Petri net languages
• Descriptive set theory
• \(X\)-automata on \(\omega\)-words
• Model theory
• Logic, semigroups and automata on words
• Closure properties of locally finite \(\omega\)-languages
• Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
• Weak Second‐Order Arithmetic and Finite Automata
• Dynamic Consistency, Revelations in Auctions and the Structure of Preferences
• On ω-regular sets
• Π₁¹ Borel sets
• Formal languages defined by the underlying structure of their words
• Stretchings
• Solving Sequential Conditions by Finite-State Strategies
• Decision problems forω-automata
• Locally finite languages
• Computer science and the fine structure of Borel sets
• Topological properties of omega context-free languages

This page was built for publication: Topological complexity of locally finite \(\omega\)-languages