Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles

DOI10.1007/978-3-642-32589-2_46zbMath1365.68334OpenAlexW174017897MaRDI QIDQ2912750

David Janin

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_46

Mathematics Subject Classification ID

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

Related Items (1)

On labeled birooted tree languages: algebras, automata and logic

This page was built for publication: Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles