|
|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, Number 8, Pages 19–25
(Mi ivm3051)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Realizability of words in mosaic labyrinths
V. I. Grunskaya Chair of Mathematics and Information Science, Dimitrovgrad Branch of Ul'yanovsk State University, Dimitrovgrad, Ul'yanovsk Region, Russia
Abstract:
In this paper we study mosaic labyrinths with the help of words generated by them in the alphabet of labels attached to arcs and vertices of a labyrinth. We consider the problem of the characterization of words generated by a labyrinth. We propose a constructive recognition criterion, it defines whether a word is generated by a labyrinth or not. We establish conditions under which a word can be generated by a unique labyrinth, by a finite number of labyrinths, or by infinitely many labyrinths.
Keywords:
mosaic labyrinth, realizable word, consistent word, convolution, $m$-correct word.
Received: 14.05.2007
Citation:
V. I. Grunskaya, “Realizability of words in mosaic labyrinths”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 8, 19–25; Russian Math. (Iz. VUZ), 53:8 (2009), 15–19
Linking options:
https://www.mathnet.ru/eng/ivm3051 https://www.mathnet.ru/eng/ivm/y2009/i8/p19
|
|