Two-way Automata and Regular Languages of Overlapping Tiles

DOI10.3233/FI-2015-1278MaRDI QIDQ3187048zbMATH OpenOpenAlexFDO

Authors Anne Dicky, David Janin

Publication date 15 August 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1278

zbMATH Keywords

McAlister inverse monoidoverlapping tile languagesregular languagestwo-way automataword languages

Mathematics Subject Classification ID

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

Recommendations

• On languages of one-dimensional overlapping tiles
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Overlapping tile automata
• A brief excursion inside the class of tiling recognizable two-dimensional languages
• scientific article; zbMATH DE number 177806
• Tiling Recognizable Two-Dimensional Languages
• Two-way finite automata: old and recent results
• Two-way finite automata: old and recent results
• Two-way automata over locally finite semirings
• A survey of two-dimensional automata theory

Cited in

(6)

• Strip tiling and regular grammars
• On labeled birooted tree languages: algebras, automata and logic
• Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles (extended abstract)
• On languages of one-dimensional overlapping tiles
• Overlapping tile automata
• Algebraic tools for the overlapping tile product

This page was built for publication: Two-way Automata and Regular Languages of Overlapping Tiles

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