Realizability of words in mosaic labyrinths
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (2009), pp. 19-25
Voir la notice de l'article provenant de la source Math-Net.Ru
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, $m$-correct word.
Mots-clés : convolution
Mots-clés : convolution
@article{IVM_2009_8_a2,
author = {V. I. Grunskaya},
title = {Realizability of words in mosaic labyrinths},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {19--25},
publisher = {mathdoc},
number = {8},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2009_8_a2/}
}
V. I. Grunskaya. Realizability of words in mosaic labyrinths. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (2009), pp. 19-25. http://geodesic.mathdoc.fr/item/IVM_2009_8_a2/