Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
From MaRDI portal
Publication:3560552
DOI10.3233/FI-2010-221zbMath1196.68117MaRDI QIDQ3560552
Marcella Anselmo, Marina Madonia, Dora Giammarresi
Publication date: 14 May 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Related Items (15)
Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory ⋮ Unbordered Pictures: Properties and Construction ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Structure and properties of strong prefix codes of pictures ⋮ Unnamed Item ⋮ Classes of two-dimensional languages and recognizability conditions ⋮ Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages ⋮ Picture codes and deciphering delay ⋮ Two-dimensional pattern matching against local and regular-like picture languages ⋮ Towards More Expressive 2D Deterministic Automata ⋮ Sets of Pictures Avoiding Overlaps ⋮ Deterministic ordered restarting automata for picture languages ⋮ Automata with cyclic move operations for picture languages ⋮ Two-dimensional models ⋮ Two-dimensional codes
This page was built for publication: Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
