On the Complexity of Unary Tiling-Recognizable Picture Languages

DOI10.1007/978-3-540-70918-3_33zbMath1159.68473OpenAlexW1566241976MaRDI QIDQ3590949

Violetta Lonati, Massimiliano Goldwurm, Alberto Bertoni

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_33

zbMATH Keywords

Turing machinetiling systemshead reversalunary picture languages

Mathematics Subject Classification ID

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

Related Items (3)

Deterministic Two-Dimensional Languages over One-Letter Alphabet ⋮ Deterministic and unambiguous two-dimensional languages over one-letter alphabet ⋮ Picture Languages Generated by Assembling Tiles

This page was built for publication: On the Complexity of Unary Tiling-Recognizable Picture Languages