The lattice of semiretracts of a free monoid

DOI10.1080/00207169208804078zbMath0749.68046OpenAlexW1986445962MaRDI QIDQ4016384

James A. Anderson, Tom Head

Publication date: 14 December 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804078

zbMATH Keywords

semigroupsmonoidsregular languagescodesretracts

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Semiretracts of a free monoid ⋮ An algorithmic approach to the problem of a semiretract base ⋮ On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Retractions and retracts of free topological monoids ⋮ The intersection of retracts of \(A^{*}\)

Cites Work

• The intersection of free submonoids of a free monoid is free
• 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
• Equality languages and fixed point languages
• Expanded subalphabets in the theories of languages and semigroups†