An algorithmic approach to the problem of a semiretract base

DOI10.1016/j.tcs.2006.09.009zbMath1153.68042OpenAlexW2025061645MaRDI QIDQ861270

Tomasz Krawczyk, Wit Foryś

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

algorithmretractfree monoidkey-codesemiretract

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Semiretracts of a free monoid
• Code properties of minimal generating sets of retracts and semiretracts
• Semiretracts -- a counterexample and some results.
• The intersection of retracts of \(A^{*}\)
• The poset of retracts of a free monoid
• Fixed languages and the adult languages of ol schemest^†
• Expanded subalphabets in the theories of languages and semigroups†
• The lattice of semiretracts of a free monoid

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