The poset of retracts of a free monoid

DOI10.1080/00207169008803933MaRDI QIDQ3210899zbMATH OpenOpenAlexFDO

Authors Wit Foryś, Tom Head

Publication date 1990

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

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

zbMATH Keywords

codesmonoidsretractssemigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The lattice of semiretracts of a free monoid
• scientific article; zbMATH DE number 1560293
• An algorithmic approach to the problem of a semiretract base
• Semiretracts of a free monoid
• Code properties of minimal generating sets of retracts and semiretracts

Cites work

• Automata that recognize intersections of free submonoids
• Equality languages and fixed point languages
• Expanded subalphabets in the theories of languages and semigroups†
• On the family of retracts of free monoids
• The intersection of free submonoids of a free monoid is free

Cited in

(10)

• Positive theories of free monoids
• 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^{*}\)
• Retractions and retracts of free topological monoids
• The lattice of semiretracts of a free monoid
• Asymptotic behaviour of bi-infinite words
• Order varieties and monotone retractions of finite posets
• An algorithmic approach to the problem of a semiretract base

This page was built for publication: The poset of retracts of a free monoid

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