A topological approach to a conjecture of Rhodes

DOI10.1017/S0004972700027805zbMath0659.20056WikidataQ123209200 ScholiaQ123209200MaRDI QIDQ3808324

Jean-Eric Pin

Publication date: 1988

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

kernel; finite monoid; finitely generated free monoid; recognizable; relational morphism; monoid homomorphisms; Rhodes' conjecture

Mathematics Subject Classification ID

20M35: Semigroups in automata theory, linguistics, etc.

20M15: Mappings of semigroups

Related Items

Polynomial closure of group languages and open sets of the Hall topology, Finite loops recognize exactly the regular open languages, ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS, PROFINITE METHODS IN SEMIGROUP THEORY, COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY, On the complexity of computing the profinite closure of a rational language, Reduction theorem for the type-II conjecture for finite monoids, On a conjecture of Rhodes, Topologies for the free monoid, New results on the conjecture of Rhodes and on the topological conjecture, Polynomial closure of group languages and open sets of the Hall topology, Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies, Commutative images of rational languages and the Abelian kernel of a monoid

Cites Work

• Une topologie du monoide libre
• Sur mon article Une topologie du monoide libre
• Improved lower bounds for the complexity of finite semigroups