Recognizable vs. Regular Picture Languages
From MaRDI portal
Publication:3522862
Recommendations
Cites work
- scientific article; zbMATH DE number 1688390 (Why is no real title available?)
- scientific article; zbMATH DE number 5141495 (Why is no real title available?)
- scientific article; zbMATH DE number 4049110 (Why is no real title available?)
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- scientific article; zbMATH DE number 1222610 (Why is no real title available?)
- scientific article; zbMATH DE number 1223636 (Why is no real title available?)
- scientific article; zbMATH DE number 871248 (Why is no real title available?)
- A characterization of recognizable picture languages by tilings by finite sets
- Context-sensitive string languages and recognizable picture languages
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Matrix-based complexity functions and recognizable picture languages
- 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
- Recognizable picture languages and domino tiling
- Recognizable vs. Regular Picture Languages
- Regular expressions and context-free grammars for picture languages
- Some properties of two-dimensional on-line tessellation acceptors
- Tiling Recognizable Two-Dimensional Languages
- Unambiguous recognizable two-dimensional languages
Cited in
(34)- Recognizable vs. Regular Picture Languages
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- scientific article; zbMATH DE number 4005638 (Why is no real title available?)
- scientific article; zbMATH DE number 1836422 (Why is no real title available?)
- Towards more expressive 2D deterministic automata
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- Simple picture processing based on finite automata and regular grammars
- Two-dimensional palindromes and their properties
- On regular drawn symbolic picture languages
- On bigram languages
- Adding symbolic information to picture models: definitions and properties
- Picture languages
- A logical approach to locality in pictures languages
- Picture iteration and picture ambiguity
- Expressiveness and complexity of regular pure two-dimensional context-free languages
- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- Problems on finite automata and the exponential time hypothesis
- Recognizable Picture Languages and Polyominoes
- Developments in Language Theory
- A note on identities of two-dimensional languages
- An Eilenberg Theorem for Pictures
- Two dimensional fuzzy regular languages
- Matrix-based complexity functions and recognizable picture languages
- Regular geometrical languages and tiling the plane
- scientific article; zbMATH DE number 1408354 (Why is no real title available?)
- VISUALIZING LANGUAGES USING PRIMITIVE POWERS
- Restarting automata for picture languages: a survey on recent developments
- Two-dimensional models
- 2D oxide picture languages and their properties
- Characterizations of recognizable picture series
- Descriptive complexity for pictures languages
- A common framework to recognize two-dimensional languages
- Recognizable languages of arrows and cospans
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
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)
