EXPLORING INSIDE TILING RECOGNIZABLE PICTURE LANGUAGES TO FIND DETERMINISTIC SUBCLASSES

DOI10.1142/S0129054111008854zbMath1252.68171OpenAlexW2087865108MaRDI QIDQ2909092

Dora Giammarresi

Publication date: 29 August 2012

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

Full work available at URL: https://doi.org/10.1142/s0129054111008854

zbMATH Keywords

determinismtwo-dimensional languagestiling systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A computational model for tiling recognizable two-dimensional languages
• Deterministic and unambiguous two-dimensional languages over one-letter alphabet
• Some properties of two-dimensional on-line tessellation acceptors
• Complexity of two-dimensional patterns
• Recognizable picture languages and domino tiling
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• Tile rewriting grammars and picture languages

This page was built for publication: EXPLORING INSIDE TILING RECOGNIZABLE PICTURE LANGUAGES TO FIND DETERMINISTIC SUBCLASSES