Locally finite languages

DOI10.1016/S0304-3975(99)00286-8zbMath0974.68096OpenAlexW2083828428MaRDI QIDQ5941071

Olivier Finkel

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00286-8

zbMATH Keywords

locally finite languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Closure properties of locally finite \(\omega\)-languages ⋮ On decidability properties of local sentences ⋮ A hierarchy of tree-automatic structures ⋮ Topological complexity of locally finite \(\omega\)-languages ⋮ ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES ⋮ Computer science and the fine structure of Borel sets ⋮ Locally finite ω-languages and effective analytic sets have the same topological complexity

Cites Work

• Finite-model theory -- A personal perspective
• Topological complexity of locally finite \(\omega\)-languages
• A logical approach of Petri net languages
• Automates a file
• The monadic second order theory of all countable ordinals
• A theory of timed automata
• Finite automata and ordinals
• Model theory
• Logic, semigroups and automata on words
• A hierarchy between context-free and context-sensitive languages
• Weak Second‐Order Arithmetic and Finite Automata
• Languages that Capture Complexity Classes
• Formal languages defined by the underlying structure of their words
• Stretchings
• Intercalation theorems for stack languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item