On the insertion of n-powers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F19%3A00108233" target="_blank" >RIV/00216224:14310/19:00108233 - isvavai.cz</a>

Výsledek na webu

<a href="https://dmtcs.episciences.org/5155" target="_blank" >https://dmtcs.episciences.org/5155</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On the insertion of n-powers

Popis výsledku v původním jazyce

In algebraic terms, the insertion of n-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality 1 &lt;= x(n). We compare this pseudovariety with several other natural pseudovarieties of ordered monoids and of monoids associated with the Burnside pseudovariety of groups defined by the identity x(n) = 1. In particular, we are interested in determining the pseudovariety of monoids that it generates, which can be viewed as the problem of determining the Boolean closure of the class of regular languages closed under n-power insertions. We exhibit a simple upper bound and show that it satisfies all pseudoidentities which are provable from 1 &lt;= x(n) in which both sides are regular elements with respect to the upper bound.

Název v anglickém jazyce

On the insertion of n-powers

Popis výsledku anglicky

In algebraic terms, the insertion of n-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality 1 &lt;= x(n). We compare this pseudovariety with several other natural pseudovarieties of ordered monoids and of monoids associated with the Burnside pseudovariety of groups defined by the identity x(n) = 1. In particular, we are interested in determining the pseudovariety of monoids that it generates, which can be viewed as the problem of determining the Boolean closure of the class of regular languages closed under n-power insertions. We exhibit a simple upper bound and show that it satisfies all pseudoidentities which are provable from 1 &lt;= x(n) in which both sides are regular elements with respect to the upper bound.

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/GA15-02862S" target="_blank" >GA15-02862S: Aplikace algebry a kombinatoriky v teorii formálních jazyků</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

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

ISSN

1462-7264

e-ISSN

—

Svazek periodika

21

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

FR - Francouzská republika

Počet stran výsledku

18

Strana od-do

1-18

Kód UT WoS článku

000480436900008

EID výsledku v databázi Scopus

2-s2.0-85062696327