An algorithmic approach to the problem of a semiretract base

Authors:
Wit Forys;Tomasz Krawczyk
Affiliations:
Institute of Computer Science, Jagiellonian University, Nawojki, Krakow, Poland;Institute of Computer Science, Jagiellonian University, Nawojki, Krakow, Poland
Venue:
Theoretical Computer Science
Year:
2006

Citing 5
Cited 0

Semiretracts of a free monoid

Selected papers of the second international colloquium on Words, languages and combinatorics
The intersection of retracts of A

Theoretical Computer Science
Semigroups and Combinatorial Applications

Semigroups and Combinatorial Applications
Theory of Codes

Theory of Codes
Semiretracts: a counterexample and some results

Theoretical Computer Science - WORDS

Quantified Score

Hi-index	5.23

Visualization

Abstract

A semiretract of a free monoid A* is an intersection of a family of retracts of A* and it is a free submonoid. In the paper we propose an algorithmic approach to the problem of finding the base (code) of a semiretract.