RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 2009 Number 8, Pages 19–25 (Mi ivm3051)

This article is cited 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.

UDC: 519.17+519.713

Received: 14.05.2007


 English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2009, 53:8, 15–19

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024