Snake-Deterministic Tiling Systems

DOI10.1007/978-3-642-03816-7_47zbMath1250.68168OpenAlexW1544916959MaRDI QIDQ3182954

Matteo Pradella, Violetta Lonati

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_47

zbMATH Keywords

determinismpicture languageunambiguitytiling systems2D languageonline tessellation automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Classes of two-dimensional languages and recognizability conditions ⋮ Strategies to scan pictures with automata based on Wang tiles ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Towards More Expressive 2D Deterministic Automata ⋮ Two-dimensional models

Cites Work

• Unnamed Item
• A computational model for tiling recognizable two-dimensional languages
• Some properties of two-dimensional on-line tessellation acceptors
• Complexity of two-dimensional patterns
• A survey of two-dimensional automata theory
• Unambiguous recognizable two-dimensional languages
• Regional Languages and Tiling: A Unifying Approach to Picture Grammars
• 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: Snake-Deterministic Tiling Systems