Zimina algoritms
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Diplomdarbā tiek aplūkoti noteiktā alfabētā veidotu vārdu kombinatorikas tipa uzdevumi. Patvaļīgam alfabētam aplūko valodu, sastāvošu no vārdiem, ko ar nedzēsošiem morfismiem iespējams iegūt no fiksēta parauga. Darbā iekļauti ar nenovēršama parauga un parauga reducējamības jēdzieniem saistīti rezultāti, kā arī galvenos jēdzienus un rezultātus ilustrējoši piemēri.
In the work some problems of combinatorics on words over a given finite alphabet are analysed. The properties of languages consisting of words that can be obtained from a fixed pattern by some non-erasing morphism are studied. Some basic results concerning avoidability and reducibility of patterns are considered more in details. Several illustrative examples are presented as well.
In the work some problems of combinatorics on words over a given finite alphabet are analysed. The properties of languages consisting of words that can be obtained from a fixed pattern by some non-erasing morphism are studied. Some basic results concerning avoidability and reducibility of patterns are considered more in details. Several illustrative examples are presented as well.