Recognizable picture languages and domino tiling

DOI10.1016/S0304-3975(96)00283-6zbMath0912.68106MaRDI QIDQ1391540

Michel Latteux, David Simplot

Publication date: 22 July 1998

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

zbMATH Keywords

local picture languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (21)

A logical approach to locality in pictures languages ⋮ Consensus Game Acceptors ⋮ Finite state automata representing two-dimensional subshifts ⋮ EXPLORING INSIDE TILING RECOGNIZABLE PICTURE LANGUAGES TO FIND DETERMINISTIC SUBCLASSES ⋮ Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory ⋮ Context-sensitive string languages and recognizable picture languages ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Recognizable series on graphs and hypergraphs ⋮ Weighted picture automata and weighted logics ⋮ Recognizable vs. Regular Picture Languages ⋮ Consensus Game Acceptors and Iterated Transductions ⋮ Infinite games with finite knowledge gaps ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ Possibilities of constructing two dimensional pictures in DNA computing: Part II ⋮ Satisfiability via Smooth Pictures ⋮ Characterizations of recognizable picture series ⋮ Two-dimensional models ⋮ A characterization of recognizable picture languages by tilings by finite sets ⋮ Picture codes ⋮ Infinite Arrays and Domino Systems ⋮ Iteration of rational transductions

Cites Work

• Some properties of two-dimensional on-line tessellation acceptors
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizable picture languages and domino tiling