Normalization of ternary generalized pseudostandard words
| Autor: | Tereza Vesela, Ľubomíra Dvořáková, Josef Florian |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Normalization (statistics)
Discrete mathematics General Computer Science Computer science 0102 computer and information sciences 02 engineering and technology 68R15 01 natural sciences Theoretical Computer Science 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering FOS: Mathematics Mathematics - Combinatorics 020201 artificial intelligence & image processing Combinatorics (math.CO) Alphabet Ternary operation |
| DOI: | 10.48550/arxiv.1807.07248 |
| Popis: | This paper focuses on generalized pseudostandard words, defined by de Luca and De Luca in 2006. In every step of the construction, the involutory antimorphism to be applied for the pseudopalindromic closure changes and is given by a so called directive bi-sequence. The concept of a normalized form of directive bi-sequences was introduced by Blondin-Mass\'e et al. in 2013 and an algorithm for finding the normalized directive bi-sequence over a binary alphabet was provided. In this paper, we present an algorithm to find the normalized form of any directive bi-sequence over a ternary alphabet. Moreover, the algorithm was implemented in Python language and carefully tested, and is now publicly available in a module for working with ternary generalized pseudostandard words. Comment: 39 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|