A characterization of recognizable picture languages by tilings by finite sets
From MaRDI portal
Publication:1292300
DOI10.1016/S0304-3975(98)00328-4zbMath0916.68186MaRDI QIDQ1292300
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (17)
Full sets of pictures to encode pictures ⋮ Weighted picture automata and weighted logics ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Structure and properties of strong prefix codes of pictures ⋮ Recognizable vs. Regular Picture Languages ⋮ Picture codes and deciphering delay ⋮ Collage of two-dimensional words ⋮ New operations and regular expressions for two-dimensional languages over one-letter alphabet ⋮ Picture languages: tiling systems versus tile rewriting grammars. ⋮ A unifying approach to picture grammars ⋮ Two-dimensional comma-free and cylindric codes ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ Satisfiability via Smooth Pictures ⋮ Characterizations of recognizable picture series ⋮ PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES ⋮ Picture codes ⋮ Two-dimensional codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A homomorphic characterization of regular languages
- A note on morphic characterization of languages
- Complexity of two-dimensional patterns
- Tiling figures of the plane with two bars
- Recognizable picture languages and domino tiling
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Tiling with sets of polyominoes
- Regular expressions and context-free grammars for picture languages
- Tiling with polyominoes
This page was built for publication: A characterization of recognizable picture languages by tilings by finite sets
