The following pages link to Topologies for the free monoid (Q1173729):
Displaying 24 items.
- Closures of regular languages for profinite topologies. (Q467504) (← links)
- Varieties and rational functions (Q673101) (← links)
- On the complexity of computing the profinite closure of a rational language (Q719326) (← links)
- Products of languages with counter (Q917324) (← links)
- Topology on words (Q1019711) (← links)
- On a conjecture of Rhodes (Q1120685) (← links)
- New results on the conjecture of Rhodes and on the topological conjecture (Q1196825) (← links)
- \(p\)-adic topology on words (Q1320515) (← links)
- Polynomial closure of group languages and open sets of the Hall topology (Q1349899) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Profinite topologies (Q2074218) (← links)
- A noncommutative extension of Mahler's theorem on interpolation series (Q2441657) (← links)
- John Rhodes and the theory of finite semigroups. (Q2447219) (← links)
- Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies (Q2641109) (← links)
- A Lower Bound For Reversible Automata (Q2720406) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- Retractions and retracts of free topological monoids (Q3375520) (← links)
- Sur le produit avec compteur modulo un nombre premier (Q4032305) (← links)
- Finite loops recognize exactly the regular open languages (Q4571944) (← links)
- Polynomial closure of group languages and open sets of the Hall topology (Q4632445) (← links)
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS (Q4786248) (← links)
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA (Q4786288) (← links)
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS (Q4786305) (← links)
- PROFINITE METHODS IN SEMIGROUP THEORY (Q4786315) (← links)
