Realizability of words in mosaic labyrinths

DOI10.3103/S1066369X09080039MaRDI QIDQ1037069zbMATH OpenOpenAlexFDO

Authors V. I. Grunskaya

Publication date 13 November 2009

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1066369x09080039

zbMATH Keywords

\(m\)-correct wordconsistent wordconvolutionmosaic labyrinthrealizable word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On recognizing labyrinths by automata
• Distinguishability of s-labyrinths
• scientific article; zbMATH DE number 3972189
• scientific article; zbMATH DE number 647638
• Automaton recognition of doubly connected labyrinths with finite cyclic diameter

Cites work

• The Spatial Semantic Hierarchy

Cited in

(3)

• scientific article; zbMATH DE number 3279090 (Why is no real title available?)
• scientific article; zbMATH DE number 2233536 (Why is no real title available?)
• Distinguishability of s-labyrinths

This page was built for publication: Realizability of words in mosaic labyrinths

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