Distinguishability of s-labyrinths

DOI10.3103/S1066369X09100028MaRDI QIDQ736168zbMATH OpenFDO

Authors V. I. Grunskaya

Publication date 27 October 2009

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(s\)-labyrinthdistinguishability of labyrinthsdistinguishability of verticesplane rectangular labyrinth

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• On recognizing labyrinths by automata
• Automaton recognition of doubly connected labyrinths with finite cyclic diameter
• On reduction of automata in labyrinths
• Realizability of words in mosaic labyrinths
• scientific article; zbMATH DE number 3972189

Cites work

• scientific article; zbMATH DE number 3976344 (Why is no real title available?)
• scientific article; zbMATH DE number 2239801 (Why is no real title available?)
• Checking of deterministic graphs.
• Realizability of words in mosaic labyrinths
• The Spatial Semantic Hierarchy

Cited in

(4)

• Automaton recognition of doubly connected labyrinths with finite cyclic diameter
• Realizability of words in mosaic labyrinths
• On recognizing labyrinths by automata
• scientific article; zbMATH DE number 3972189 (Why is no real title available?)

This page was built for publication: Distinguishability of \(s\)-labyrinths

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