Recognizable vs. Regular Picture Languages

DOI10.1007/978-3-540-75414-5_7zbMATH Open1147.68045OpenAlexW1513456679MaRDI QIDQ3522862FDOQ3522862

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

Recommendations

• scientific article; zbMATH DE number 871248
• New operations and regular expressions for two-dimensional languages over one-letter alphabet
• Restarting automata for picture languages: a survey on recent developments
• Developments in Language Theory
• Two-dimensional models

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of recognizable picture languages by tilings by finite sets
• Unambiguous recognizable two-dimensional languages
• Some properties of two-dimensional on-line tessellation acceptors
• Title not available (Why is that?)
• Regular expressions and context-free grammars for picture languages
• Title not available (Why is that?)
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• New operations and regular expressions for two-dimensional languages over one-letter alphabet
• Title not available (Why is that?)
• Recognizable vs. Regular Picture Languages
• Deterministic Two-Dimensional Languages over One-Letter Alphabet
• Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
• Tiling Recognizable Two-Dimensional Languages
• Title not available (Why is that?)

Cited In (19)

• Title not available (Why is that?)
• Deterministic and unambiguous two-dimensional languages over one-letter alphabet
• Title not available (Why is that?)
• On regular drawn symbolic picture languages
• Adding symbolic information to picture models: definitions and properties
• Picture languages
• Picture iteration and picture ambiguity
• New operations and regular expressions for two-dimensional languages over one-letter alphabet
• Developments in Language Theory
• Recognizable Picture Languages and Polyominoes
• Problems on finite automata and the exponential time hypothesis
• An Eilenberg Theorem for Pictures
• A note on identities of two-dimensional languages
• Two dimensional fuzzy regular languages
• Title not available (Why is that?)
• VISUALIZING LANGUAGES USING PRIMITIVE POWERS
• Recognizable languages of arrows and cospans
• Two-Dimensional Palindromes and Their Properties
• Recognizable vs. Regular Picture Languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522862)