Tiling Recognizable Two-Dimensional Languages

DOI10.1007/978-3-540-75414-5_5zbMath1148.68400OpenAlexW1581571822MaRDI QIDQ3522860

Dora Giammarresi

Publication date: 4 September 2008

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_5

zbMATH Keywords

determinismtwo-dimensional languagesautomata and formal languagesunambiguitytiling systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Recognizable vs. Regular Picture Languages ⋮ New operations and regular expressions for two-dimensional languages over one-letter alphabet ⋮ Picture Languages Generated by Assembling Tiles

Cites Work

• Unnamed Item
• Unnamed Item
• Some properties of two-dimensional on-line tessellation acceptors
• Complexity of two-dimensional patterns
• Nondeterminism versus determinism of finite automata over directed acyclic graphs
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• New operations and regular expressions for two-dimensional languages over one-letter alphabet
• Unambiguous recognizable two-dimensional languages
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Deterministic Two-Dimensional Languages over One-Letter Alphabet
• Regular expressions and context-free grammars for picture languages
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages

This page was built for publication: Tiling Recognizable Two-Dimensional Languages