Formal languages defined by the underlying structure of their words

DOI10.2307/2274601zbMath0688.03024OpenAlexW4249826307MaRDI QIDQ4206717

No author found.

Publication date: 1988

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274601

zbMATH Keywords

finite structuresfree local languageslocal first-order sentences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Model theory of finite structures (03C13)

Related Items (7)

Closure properties of locally finite \(\omega\)-languages ⋮ On decidability properties of local sentences ⋮ Stretchings ⋮ Topological complexity of locally finite \(\omega\)-languages ⋮ Locally finite languages ⋮ Computer science and the fine structure of Borel sets ⋮ Locally finite ω-languages and effective analytic sets have the same topological complexity

This page was built for publication: Formal languages defined by the underlying structure of their words