A characterization of recognizable picture languages by tilings by finite sets
From MaRDI portal
Publication:1292300
DOI10.1016/S0304-3975(98)00328-4zbMATH Open0916.68186MaRDI QIDQ1292300FDOQ1292300
Authors: David Simplot 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tiling with sets of polyominoes
- Tiling with polyominoes
- Complexity of two-dimensional patterns
- 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?)
- Tiling figures of the plane with two bars
- Regular expressions and context-free grammars for picture languages
- A note on morphic characterization of languages
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- Title not available (Why is that?)
- A homomorphic characterization of regular languages
Cited In (21)
- Prefix picture codes: a decidable class of two-dimensional codes
- Two-dimensional codes
- Classification of string languages via tiling recognizable picture languages
- Full sets of pictures to encode pictures
- \(+\omega\)-picture languages recognizable by Büchi-tiling systems
- Satisfiability via smooth pictures
- Picture codes
- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- Weighted picture automata and weighted logics
- Recognizable picture languages and domino tiling
- Picture languages: tiling systems versus tile rewriting grammars.
- Picture codes and deciphering delay
- A Nivat theorem for weighted picture automata and weighted MSO logic
- A unifying approach to picture grammars
- Two-dimensional comma-free and cylindric codes
- Collage of two-dimensional words
- Structure and properties of strong prefix codes of pictures
- Characterizations of recognizable picture series
- Picture Languages Generated by Assembling Tiles
- Recognizable vs. Regular Picture Languages
- Characterization and measure of infinite two-dimensional strong prefix 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)
