Semiretracts -- a counterexample and some results.

DOI10.1016/S0304-3975(03)00096-3zbMath1058.68069OpenAlexW2061200756WikidataQ124814173 ScholiaQ124814173MaRDI QIDQ1426040

James A. Anderson, Tomasz Krawczyk, Wit Foryś

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00096-3

zbMATH Keywords

Free monoidRetractSemiretract

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

An algorithmic approach to the problem of a semiretract base

Cites Work

• Semiretracts of a free monoid
• The intersection of retracts of \(A^{*}\)
• Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies
• The poset of retracts of a free monoid
• Expanded subalphabets in the theories of languages and semigroups†

This page was built for publication: Semiretracts -- a counterexample and some results.