PROFINITE METHODS IN SEMIGROUP THEORY
Publication:4786315
DOI10.1142/S0218196702000912zbMath1083.20510OpenAlexW2062430201MaRDI QIDQ4786315
Publication date: 15 December 2002
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196702000912
finite semigroupspseudovarieties of semigroupsdecidabilitypseudo-identitiesBirkhoff variety theoremproduct pseudovarieties
Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Limits, profinite groups (20E18)
Related Items (12)
Cites Work
- Inverse semigroups and extensions of groups by semilattices
- Categories as algebra: An essential ingredient in the theory of monoids
- Almost finite expansions of arbitrary semigroups
- The kernel of monoid morphisms
- Some pseudovariety joins involving the pseudovariety of finite groups
- Partially ordered finite monoids and a theorem of I. Simon
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Semidirect products of categories and applications
- Profinite groups and Boolean graphs
- The Birkhoff theorem for finite algebras
- An algebraic proof that pseudovarieties are defined by pseudoidentities
- Topologies for the free monoid
- Two-sided wreath product of categories
- Some results on the dot-depth hierarchy
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue
- Semigroup expansions using the derived category, kernel, and Malcev products
- Over testable languages
- Polynomial closure and unambiguous product
- Profinite categories and semidirect products
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Decomposition techniques for finite semigroups, using categories. I
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
- Locality of DS and associated varieties
- Profinite categories, implicit operations and pseudovarieties of categories
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Profinite semigroups, Mal'cev products, and identities
- On finitely based pseudovarieties of the forms \({\mathbf V}*{\mathbf D}\) and \({\mathbf V}*{\mathbf D}_n\)
- Finite semigroup varieties of the form V*D
- Graph congruences and wreath products
- Characterizations of locally testable events
- Improved lower bounds for the complexity of finite semigroups
- Lower bounds for complexity of finite semigroups
- Finite state automata: A geometric approach
- GLOBALS OF PSEUDOVARIETIES OF COMMUTATIVE SEMIGROUPS: THE FINITE BASIS PROBLEM, DECIDABILITY AND GAPS
- Dynamics of implicit operations and tameness of pseudovarieties of groups
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- A topological approach to a conjecture of Rhodes
- A Conjecture on the Hall Topology for the Free Group
- 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
- On The Profinite Topology on a Free Group
- THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
- REDUCED FACTORIZATIONS IN FREE PROFINITE GROUPS AND JOIN DECOMPOSITIONS OF PSEUDOVARIETIES
- The pseudovariety $J$ is hyperdecidable
- Irreducibility of certain pseudovarieties1
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- On Pointlike Sets and Joins of Pseudovarieties
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
- POLYNOMIAL CLOSURE AND TOPOLOGY
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- FREE PRODUCT, PROFINITE TOPOLOGY AND FINITELY GENERATED SUBGROUPS
- THE SEMIDIRECTLY CLOSED PSEUDOVARIETY GENERATED BY APERIODIC BRANDT SEMIGROUPS
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- Extending partial automorphisms and the profinite topology on free groups
- A delay theorem for pointlikes
This page was built for publication: PROFINITE METHODS IN SEMIGROUP THEORY