Strategies to scan pictures with automata based on Wang tiles
From MaRDI portal
Publication:3006164
DOI10.1051/ita/2011016zbMath1219.68100OpenAlexW2075140623MaRDI QIDQ3006164
Violetta Lonati, Matteo Pradella
Publication date: 10 June 2011
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222010
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory ⋮ Full sets of pictures to encode pictures ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Two-dimensional pattern matching against local and regular-like picture languages ⋮ Towards More Expressive 2D Deterministic Automata ⋮ Two-dimensional models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving NP-complete problems in the tile assembly model
- Perfectly quilted rectangular snake tilings
- Some properties of two-dimensional on-line tessellation acceptors
- Complexity of two-dimensional patterns
- Snake-Deterministic Tiling Systems
- Picture Recognizability with Automata Based on Wang Tiles
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
This page was built for publication: Strategies to scan pictures with automata based on Wang tiles
