Pages that link to "Item:Q5483459"

The following pages link to SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS (Q5483459):

Displaying 19 items.

• Presentations of Schützenberger groups of minimal subshifts. (Q375868) (← links)
• A geometric interpretation of the Schützenberger group of a minimal subshift (Q517222) (← links)
• On the endomorphism monoid of a profinite semigroup (Q555197) (← links)
• Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
• Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. (Q869222) (← links)
• A combinatorial property of ideals in free profinite monoids. (Q964524) (← links)
• Maximal subgroups of the minimal ideal of a free profinite monoid are free. (Q980498) (← links)
• Infinite-vertex free profinite semigroupoids and symbolic dynamics. (Q1004467) (← links)
• Towards a pseudoequational proof theory (Q1729826) (← links)
• Profinite topologies (Q2074218) (← links)
• Pronilpotent quotients associated with primitive substitutions (Q2144383) (← links)
• On the group of a rational maximal bifix code (Q2178790) (← links)
• Pro-aperiodic monoids via saturated models (Q2279939) (← links)
• Iterated periodicity over finite aperiodic semigroups (Q2434750) (← links)
• The Karoubi envelope of the mirage of a subshift (Q5160025) (← links)
• Representations of relatively free profinite semigroups, irreducibility, and order primitivity (Q5217888) (← links)
• ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS (Q5389117) (← links)
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY (Q5493856) (← links)
• A profinite approach to complete bifix decodings of recurrent languages (Q6133256) (← links)