Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
From MaRDI portal
Recommendations
- A computational model for tiling 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
- Complexity of two-dimensional patterns
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Implementation and Application of Automata
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Some properties of two-dimensional on-line tessellation acceptors
- Three-way automata on rectangular types over a one-letter alphabet
- Two-dimensional alternative Turing machines
- Unambiguous recognizable two-dimensional languages
- Weighted Picture Automata and Weighted Logics
Cited in
(20)- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Full sets of pictures to encode pictures
- Restarting tiling automata
- Classification of string languages via tiling recognizable picture languages
- Strategies to scan pictures with automata based on Wang tiles
- Two-way Automata and Regular Languages of Overlapping Tiles
- Picture recognizability with automata based on Wang tiles
- Non-expandable non-overlapping sets of pictures
- Tiling Recognizable Two-Dimensional Languages
- A brief excursion inside the class of tiling recognizable two-dimensional languages
- On Complexity of Two Dimensional Languages Generated by Transducers
- A common framework to recognize two-dimensional languages
- Towards more expressive 2D deterministic automata
- Restarting tiling automata
- Deterministic recognizability of picture languages with Wang automata
- Implementation and Application of Automata
- Transducer generated arrays of robotic nano-arms
- A computational model for tiling recognizable two-dimensional languages
- Tiling problems, automata, and tiling graphs
This page was built for publication: Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503914)
