Recognizable vs. Regular Picture Languages

DOI10.1007/978-3-540-75414-5_7zbMath1147.68045OpenAlexW1513456679MaRDI QIDQ3522862

Oliver Matz

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_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Problems on finite automata and the exponential time hypothesis ⋮ Recognizable vs. Regular Picture Languages ⋮ Two-Dimensional Palindromes and Their Properties ⋮ Deterministic and unambiguous two-dimensional languages over one-letter alphabet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of two-dimensional on-line tessellation acceptors
• A characterization of recognizable picture languages by tilings by finite sets
• Context-sensitive string languages and recognizable picture languages
• Recognizable picture languages and domino tiling
• 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 Recognizable Two-Dimensional Languages
• Recognizable vs. Regular Picture 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
• Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures

This page was built for publication: Recognizable vs. Regular Picture Languages