An algorithmic approach to the problem of a semiretract base

DOI10.1016/J.TCS.2006.09.009MaRDI QIDQ861270zbMATH OpenOpenAlexFDO

Authors Wit Foryś, Tomasz Krawczyk

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.09.009

zbMATH Keywords

algorithmfree monoidkey-coderetractsemiretract

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1560293
• The lattice of semiretracts of a free monoid
• scientific article; zbMATH DE number 1047917
• Semiretracts of a free monoid
• Code properties of minimal generating sets of retracts and semiretracts

Cites work

• Code properties of minimal generating sets of retracts and semiretracts
• Expanded subalphabets in the theories of languages and semigroups†
• Fixed languages and the adult languages of ol schemest^†
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• Semiretracts -- a counterexample and some results.
• Semiretracts of a free monoid
• The intersection of retracts of \(A^{*}\)
• The lattice of semiretracts of a free monoid
• The poset of retracts of a free monoid

Cited in

(4)

• The base of the intersection of two free submonoids
• Code properties of minimal generating sets of retracts and semiretracts
• The poset of retracts of a free monoid
• scientific article; zbMATH DE number 1560293 (Why is no real title available?)

This page was built for publication: An algorithmic approach to the problem of a semiretract base

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861270)