Characterizations of recognizable picture series
type: Item
instance of: scholarly article
title: Characterizations of recognizable picture series
zbMATH Open document ID: 1164.68016
published in: Theoretical Computer Science
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 5567395
zbMATH Keywords: picture series
zbMATH Keywords: two-dimensional languages
zbMATH Keywords: unambiguity
zbMATH Keywords: automata
author: Ina Fichtner
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.01.019
OpenAlex ID: W1993241905
cites work: Unambiguous recognizable two-dimensional languages
cites work: Q3994777
cites work: Q3431476
cites work: Collage of two-dimensional words
cites work: Tile rewriting grammars and picture languages
cites work: Q4209252
cites work: Q4079524
cites work: Syntactic methods in pattern recognition
cites work: Q4874662
cites work: Q4714446
cites work: Monadic second-order logic over rectangular pictures and recognizability by tiling systems
cites work: Q4700998
cites work: Q4229053
cites work: Some properties of two-dimensional on-line tessellation acceptors
cites work: A survey of two-dimensional automata theory
cites work: Q2762794
cites work: Q3704880
cites work: Recognizable picture languages and domino tiling
cites work: Complexity of two-dimensional patterns
cites work: Regular expressions and context-free grammars for picture languages
cites work: Weighted Picture Automata and Weighted Logics
cites work: Q5595902
cites work: Q4155837
cites work: On the definition of a family of automata
cites work: A characterization of recognizable picture languages by tilings by finite sets
cites work: Star-free picture expressions are strictly weaker than first-order logic
DOI: 10.1016/J.TCS.2007.01.019
description: scientific article; zbMATH DE number 5567395