Normalization of ternary generalized pseudostandard words

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F19%3A00330954" target="_blank" >RIV/68407700:21340/19:00330954 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.tcs.2019.02.010" target="_blank" >https://doi.org/10.1016/j.tcs.2019.02.010</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2019.02.010" target="_blank" >10.1016/j.tcs.2019.02.010</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Normalization of ternary generalized pseudostandard words

Popis výsledku v původním jazyce

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é 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.

Název v anglickém jazyce

Normalization of ternary generalized pseudostandard words

Popis výsledku anglicky

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é 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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

<a href="/cs/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Centrum pokročilých aplikovaných přírodních věd</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

1879-2294

Svazek periodika

780

Číslo periodika v rámci svazku

August

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

25

Strana od-do

29-53

Kód UT WoS článku

000472246600004

EID výsledku v databázi Scopus

2-s2.0-85062346837