On the insertion of n-powers

Result code in 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>
Result on the web
<a href="https://dmtcs.episciences.org/5155" target="_blank" >https://dmtcs.episciences.org/5155</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On the insertion of n-powers
Original language description
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 <= 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 <= x(n) in which both sides are regular elements with respect to the upper bound.
Czech name
—
Czech description
—

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

Project
<a href="/en/project/GA15-02862S" target="_blank" >GA15-02862S: Applications of Algebra and Combinatorics in Formal Language Theory</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)