On languages of one-dimensional overlapping tiles

DOI10.1007/978-3-642-35843-2_22MaRDI QIDQ2927650zbMATH OpenOpenAlexFDO

Authors David Janin

Publication date 4 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• Two-way Automata and Regular Languages of Overlapping Tiles
• Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles (extended abstract)
• Overlapping tile automata
• Algebraic tools for the overlapping tile product
• Some remarks on tiling recognizable languages

Cited in

(8)

• On labeled birooted tree languages: algebras, automata and logic
• Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles (extended abstract)
• Embedding finite and infinite words into overlapping tiles (short paper)
• Two-way Automata and Regular Languages of Overlapping Tiles
• Overlapping tile automata
• Algebraic tools for the overlapping tile product
• Loop patterns formed by cellular automata
• A syntactic congruence for languages of birooted trees

This page was built for publication: On languages of one-dimensional overlapping tiles

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