A stronger recognizability condition for two-dimensional languages

MaRDI QIDQ5747393zbMATH OpenFDO

Authors Marcella Anselmo, Maria Madonia

Publication date 14 February 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2113/0.html

zbMATH Keywords

two-dimensional languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Comparing necessary conditions for recognizability of two-dimensional languages
• Classes of two-dimensional languages and recognizability conditions
• scientific article; zbMATH DE number 871248
• Tiling Recognizable Two-Dimensional Languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages

Cited in

(11)

• Two-dimensional connected pictures are not recognizable by finite-state acceptors
• Two-dimensional models
• Communication complexity tools on recognizable picture languages
• Classes of two-dimensional languages and recognizability conditions
• On Some Classes of 2D Languages and Their Relations
• Comparing necessary conditions for recognizability of two-dimensional languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• On Complexity of Two Dimensional Languages Generated by Transducers
• scientific article; zbMATH DE number 871248 (Why is no real title available?)
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• Some remarks on tiling recognizable languages

This page was built for publication: A stronger recognizability condition for two-dimensional languages

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