A characterization of recognizable picture languages by tilings by finite sets
From MaRDI portal
Publication:1292300
Recommendations
Cites work
- scientific article; zbMATH DE number 3829283 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 17705 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 871248 (Why is no real title available?)
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- A homomorphic characterization of regular languages
- A note on morphic characterization of languages
- Complexity of two-dimensional patterns
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Recognizable picture languages and domino tiling
- Regular expressions and context-free grammars for picture languages
- Tiling figures of the plane with two bars
- Tiling with polyominoes
- Tiling with sets of polyominoes
Cited in
(21)- Satisfiability via smooth pictures
- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- A unifying approach to picture grammars
- Weighted picture automata and weighted logics
- Full sets of pictures to encode pictures
- Two-dimensional comma-free and cylindric codes
- Collage of two-dimensional words
- Structure and properties of strong prefix codes of pictures
- Classification of string languages via tiling recognizable picture languages
- Recognizable picture languages and domino tiling
- Recognizable vs. Regular Picture Languages
- Characterizations of recognizable picture series
- Picture languages: tiling systems versus tile rewriting grammars.
- Prefix picture codes: a decidable class of two-dimensional codes
- Picture Languages Generated by Assembling Tiles
- A Nivat theorem for weighted picture automata and weighted MSO logic
- Picture codes and deciphering delay
- \(+\omega\)-picture languages recognizable by Büchi-tiling systems
- Two-dimensional codes
- Characterization and measure of infinite two-dimensional strong prefix codes
- Picture codes
This page was built for publication: A characterization of recognizable picture languages by tilings by finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292300)
