Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages

DOI10.1007/978-3-540-76336-9_27zbMath1139.68353OpenAlexW1809252795MaRDI QIDQ3503914

Marcella Anselmo, Marina Madonia, Dora Giammarresi

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_27

zbMATH Keywords

determinismautomatatwo-dimensional languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

A computational model for tiling recognizable two-dimensional languages ⋮ Non-expandable non-overlapping sets of pictures ⋮ Full sets of pictures to encode pictures ⋮ Tiling Recognizable Two-Dimensional Languages ⋮ Strategies to scan pictures with automata based on Wang tiles ⋮ On Complexity of Two Dimensional Languages Generated by Transducers ⋮ Towards More Expressive 2D Deterministic Automata ⋮ Transducer generated arrays of robotic nano-arms

Cites Work

• Unnamed Item
• Two-dimensional alternative Turing machines
• Three-way automata on rectangular types over a one-letter alphabet
• Some properties of two-dimensional on-line tessellation acceptors
• Complexity of two-dimensional patterns
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• Unambiguous recognizable two-dimensional languages
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• Weighted Picture Automata and Weighted Logics
• Implementation and Application of Automata

This page was built for publication: Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages