All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Normalization of ternary generalized pseudostandard words

The result's identifiers

  • Result code in 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>

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Normalization of ternary generalized pseudostandard words

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Center for advanced applied science</a><br>

  • Continuities

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

Others

  • Publication year

    2019

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Theoretical Computer Science

  • ISSN

    0304-3975

  • e-ISSN

    1879-2294

  • Volume of the periodical

    780

  • Issue of the periodical within the volume

    August

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    25

  • Pages from-to

    29-53

  • UT code for WoS article

    000472246600004

  • EID of the result in the Scopus database

    2-s2.0-85062346837