The following pages link to (Q4942266):
Displaying 28 items.
- Closures of regular languages for profinite topologies. (Q467504) (← links)
- Tameness of pseudovariety joins involving R. (Q814806) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- On bases of identities for the \(\omega\)-variety generated by locally testable semigroups. (Q935166) (← links)
- Decidability and tameness in the theory of finite semigroups. (Q949087) (← links)
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. (Q1421252) (← links)
- Some key problems on finite semigroups (Q1597719) (← links)
- The \(\kappa\)-word problem over \(\mathsf{DRH}\) (Q1676315) (← links)
- Towards a pseudoequational proof theory (Q1729826) (← links)
- On syntactic groups. (Q1781927) (← links)
- Pointlike sets: the finest aperiodic cover of a finite semigroup (Q1824040) (← links)
- Subsemigroups and complexity via the presentation lemma (Q1899162) (← links)
- The word problem for \(\kappa \)-terms over the pseudovariety of local groups (Q1982578) (← links)
- Reducibility of pointlike problems (Q2362748) (← links)
- Iterated periodicity over finite aperiodic semigroups (Q2434750) (← links)
- On aperiodic relational morphisms. (Q2505011) (← links)
- Dynamics of implicit operations and tameness of pseudovarieties of groups (Q2750958) (← links)
- Pointlike reducibility of pseudovarieties of the form \(\mathbf V*\mathbf D\). (Q2799118) (← links)
- On κ-reducibility of pseudovarieties of the form V ∗D (Q2973338) (← links)
- STABLE PAIRS (Q3561121) (← links)
- Irreducibility of certain pseudovarieties<sup>1</sup> (Q4395729) (← links)
- The geometry of profinite graphs with applications to free groups and finite monoids (Q4433117) (← links)
- Some reducibility properties for pseudovarieties of the form <i>DRH</i> (Q4567814) (← links)
- Krohn-Rhodes complexity pseudovarieties are not finitely based (Q4680740) (← links)
- Syntactic semigroups and graph algebras (Q4761498) (← links)
- An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
- Semidirect product with an order-computable pseudovariety and tameness. (Q5962327) (← links)
