On the Decidability of Iterated Semidirect Products with Applications to Complexity
From MaRDI portal
semidirect productspseudovarieties of semigroupsdecidability of membershipcomplexity of finite semigroups
Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35) Products, amalgamated products, and other kinds of limits and colimits (08B25) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Recommendations
- On the hyperdecidability of semidirect products of pseudovarieties
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- On aperiodic relational morphisms.
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
Cited in
(53)- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
- Iterated periodicity over finite aperiodic semigroups
- TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- Closures of regular languages for profinite topologies.
- Tameness of Some Locally Trivial Pseudovarieties
- The pseudoidentity problem and reducibility for completely regular semigroups
- Towards a pseudoequational proof theory
- On aperiodic relational morphisms.
- On \(\kappa\)-reducibility of pseudovarieties of the form \(V \ast D\)
- Dynamics of implicit operations and tameness of pseudovarieties of groups
- Every decidable pseudovariety of abelian groups is completely tame
- Complete κ-reducibility of pseudovarieties of the form DRH
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)
- Pointlike sets and separation: a personal perspective
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- The geometry of profinite graphs with applications to free groups and finite monoids
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
- Semidirect product with an order-computable pseudovariety and tameness.
- Reducibility of pointlike problems
- An effective lower bound for group complexity of finite semigroups and automata
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- Finite state automata: a geometric approach
- McCammond’s normal forms for free aperiodic semigroups revisited
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties.
- Tameness of pseudovariety joins involving R.
- The pseudovariety of all nilpotent groups is tame
- COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY
- On the hyperdecidability of semidirect products of pseudovarieties
- Tameness of joins involving the pseudovariety of local semilattices.
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
- Relative Abelian kernels of some classes of transformation monoids
- Reducibility of Joins Involving Some Locally Trivial Pseudovarieties
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
- TAMENESS OF THE PSEUDOVARIETY LS1
- SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS
- The word problem for \(\kappa \)-terms over the pseudovariety of local groups
- PROFINITE METHODS IN SEMIGROUP THEORY
- Profinite topologies
- Some reducibility properties for pseudovarieties of the form \(DRH\)
- Irreducibility of certain pseudovarieties1
- Free profinite locally idempotent and locally commutative semigroups
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- On a problem of Brzozowski and Fich
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- Improved lower bounds for the complexity of finite semigroups
- COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
- Pointlike sets for varieties determined by groups
- Algebraic tools for the concatenation product.
- Recognizing pro-\(\mathrm{R}\) closures of regular languages
- STABLE PAIRS
This page was built for publication: On the Decidability of Iterated Semidirect Products with Applications to Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487602)
