Closure properties of locally finite \(\omega\)-languages

DOI10.1016/j.tcs.2004.03.025zbMath1070.68067OpenAlexW2008877412MaRDI QIDQ1885033

Olivier Finkel

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.025

zbMATH Keywords

Closure propertiesFormal languagesLogical definabilityInfinite wordsLocally finite languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

On decidability properties of local sentences ⋮ Topological complexity of locally finite \(\omega\)-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
• Unnamed Item
• Unnamed Item
• Finite-model theory -- A personal perspective
• A logical approach of Petri net languages
• Automates a file
• The monadic second order theory of all countable ordinals
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• Model theory
• Logic, semigroups and automata on words
• Weak Second‐Order Arithmetic and Finite Automata
• Languages that Capture Complexity Classes
• Formal languages defined by the underlying structure of their words
• Subclasses of binary NP
• Existential second-order logic over strings
• Stretchings
• Existential second-order logic over graphs
• Locally finite languages

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