The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

DOI10.3233/FI-2009-0042zbMath1179.68067OpenAlexW2129598207MaRDI QIDQ3633999

Massimiliano Goldwurm, Violetta Lonati, Alberto Bertoni

Publication date: 23 June 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-0042

zbMATH Keywords

two-dimensional languagestiling systemshead reversal-bounded computationlinearly space-bounded Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Snake-Deterministic Tiling Systems ⋮ Classes of two-dimensional languages and recognizability conditions ⋮ Strategies to scan pictures with automata based on Wang tiles ⋮ Two-dimensional models

This page was built for publication: The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases