HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
From MaRDI portal
Publication:4513299
DOI10.1142/S0218196799000163zbMath1028.20038MaRDI QIDQ4513299
Publication date: 7 November 2000
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196799000163
20M07: Varieties and pseudovarieties of semigroups
20M05: Free semigroups, generators and relations, word problems
03B25: Decidability of theories and sets of sentences
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
The pseudovariety $J$ is hyperdecidable, The geometry of profinite graphs with applications to free groups and finite monoids, Some reducibility properties for pseudovarieties of the form DRH, TAMENESS OF THE PSEUDOVARIETY LS1, The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin, Krohn-Rhodes complexity pseudovarieties are not finitely based, ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS, INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY, PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS, ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS, PROFINITE METHODS IN SEMIGROUP THEORY, Tameness of Some Locally Trivial Pseudovarieties, Extending partial automorphisms and the profinite topology on free groups, Reducibility vs. definability for pseudovarieties of semigroups, TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS, SC-hyperdecidability of \(\mathbf R\), On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\), Semidirect product with an order-computable pseudovariety and tameness., Tameness of pseudovariety joins involving R., On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties., The \(\kappa\)-word problem over \(\mathsf{DRH}\), The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages, Iterated periodicity over finite aperiodic semigroups, Finite state automata: A geometric approach, The pseudoidentity problem and reducibility for completely regular semigroups, Dynamics of implicit operations and tameness of pseudovarieties of groups, McCammond’s normal forms for free aperiodic semigroups revisited, Complete κ-reducibility of pseudovarieties of the form DRH, Reducibility of Joins Involving Some Locally Trivial Pseudovarieties, STABLE PAIRS, A PROFINITE APPROACH TO STABLE PAIRS, APERIODIC POINTLIKES AND BEYOND, COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1, On the hyperdecidability of semidirect products of pseudovarieties
Cites Work
- Categories as algebra: An essential ingredient in the theory of monoids
- The Birkhoff theorem for finite algebras
- Decidability of complexity one-half for finite semigroups
- Profinite categories and semidirect products
- Abelian pointlikes of a monoid
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Product expansions
- Profinite categories, implicit operations and pseudovarieties of categories
- Profinite semigroups, Mal'cev products, and identities
- Bases for equational theories of semi-groups
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Undecidability of the identity problem for finite semigroups
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- On the hyperdecidability of semidirect products of pseudovarieties
- The pseudovariety $J$ is hyperdecidable
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- On Pointlike Sets and Joins of Pseudovarieties
- ON A CLASS OF SEMIGROUP PSEUDOVARIETIES WITHOUT FINITE PSEUDOIDENTITY BASIS
- A SYNTACTICAL PROOF OF LOCALITY OF DA
