A characterization of recognizable picture languages by tilings by finite sets

DOI10.1016/S0304-3975(98)00328-4zbMath0916.68186MaRDI QIDQ1292300

David Simplot

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

tiling; Kleen star

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

Related Items

PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES, Picture codes and deciphering delay, A unifying approach to picture grammars, Two-dimensional comma-free and cylindric codes, Characterizations of recognizable picture series, Characterization and measure of infinite two-dimensional strong prefix codes, Full sets of pictures to encode pictures, Weighted picture automata and weighted logics, 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 Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic, Satisfiability via Smooth Pictures, Structure and properties of strong prefix codes of pictures, Picture codes, Recognizable vs. Regular Picture Languages

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item