On the insertion of n-powers

• Type: Article in International Scientific Journal
• Date: 2019

Authors

Almeida, J (Author) FCUP; Klima, O (Author) Other

Journal

The Journal is awaiting validation by the Administrative Services.

Title: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

Vol. 21

ISSN: 1462-7264

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 1 Citation

Other information

Authenticus ID: P-00Q-BA6

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 18