Formal languages defined by the underlying structure of their words

DOI10.2307/2274601MaRDI QIDQ4206717zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in 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

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

Recommendations

• scientific article; zbMATH DE number 2079028
• Locally finite languages
• Büchi context-free languages
• A note on context-free languages
• On strongly context-free languages

Cited in

(11)

• Closure properties of locally finite \(\omega\)-languages
• Well-structured languages
• Locally finite -languages and effective analytic sets have the same topological complexity
• scientific article; zbMATH DE number 2040915 (Why is no real title available?)
• scientific article; zbMATH DE number 2079028 (Why is no real title available?)
• scientific article; zbMATH DE number 1487816 (Why is no real title available?)
• Stretchings
• Locally finite languages
• Computer science and the fine structure of Borel sets
• On decidability properties of local sentences
• Topological complexity of locally finite \(\omega\)-languages

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

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