A computational model for tiling recognizable two-dimensional languages

DOI10.1016/J.TCS.2009.03.016MaRDI QIDQ840773zbMATH OpenOpenAlexFDO

Authors Marcella Anselmo, Dora Giammarresi, Maria Madonia

Publication date 14 September 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.03.016

zbMATH Keywords

determinismfinite automatatwo-dimensional languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Tiling Recognizable Two-Dimensional Languages
• A brief excursion inside the class of tiling recognizable two-dimensional languages
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• A SAT-based parser and completer for pictures specified by tiling
• A note on two-dimensional finite automata
• Complexity of two-dimensional patterns
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• Implementation and Application of Automata
• Some properties of two-dimensional on-line tessellation acceptors
• Three-way automata on rectangular types over a one-letter alphabet
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Two-dimensional alternative Turing machines
• Unambiguous recognizable two-dimensional languages
• Weighted Picture Automata and Weighted Logics

Cited in

(20)

• Unbordered pictures: properties and construction
• Restarting tiling automata
• Sets of pictures avoiding overlaps
• scientific article; zbMATH DE number 7584603 (Why is no real title available?)
• Full sets of pictures to encode pictures
• Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
• Weighted three directions OTA and weighted hexapolic picture automata
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Exploring inside tiling recognizable picture languages to find deterministic subclasses
• Deterministic ordered restarting automata for picture languages
• Tiling Recognizable Two-Dimensional Languages
• Strategies to scan pictures with automata based on Wang tiles
• Snake-Deterministic Tiling Systems
• Some classes of rational functions for pictures
• Comparing necessary conditions for recognizability of two-dimensional languages
• Non-expandable non-overlapping sets of pictures
• Restarting tiling automata
• Two-dimensional models
• 2D oxide picture languages and their properties
• A common framework to recognize two-dimensional languages

This page was built for publication: A computational model for tiling recognizable two-dimensional languages

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