Classification of string languages via tiling recognizable picture languages

DOI10.1007/978-3-642-21254-3_7MaRDI QIDQ3004570zbMATH OpenOpenAlexFDO

Authors Marcella Anselmo, Dora Giammarresi, Maria Madonia

Publication date 3 June 2011

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21254-3_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Exploring inside tiling recognizable picture languages to find deterministic subclasses
• A brief excursion inside the class of tiling recognizable two-dimensional languages
• A characterization of recognizable picture languages by tilings by finite sets
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Tiling Recognizable Two-Dimensional Languages

Cited in

(7)

• Context-sensitive string languages and recognizable picture languages
• Recognizable picture languages and domino tiling
• Decision problems and projection languages for restricted variants of two-dimensional automata
• scientific article; zbMATH DE number 7770057 (Why is no real title available?)
• From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
• Fibonacci pictures on a binary alphabet
• Row-column combination of Dyck words

This page was built for publication: Classification of string languages via tiling recognizable picture languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004570)