HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
From MaRDI portal
Publication:4513299
DOI10.1142/S0218196799000163zbMATH Open1028.20038OpenAlexW2090423038MaRDI QIDQ4513299FDOQ4513299
Authors: Jorge Almeida 
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
Recommendations
- On the hyperdecidability of semidirect products of pseudovarieties
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
- The pseudovariety $J$ is hyperdecidable
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
Decidability of theories and sets of sentences (03B25) Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Bases for equational theories of semi-groups
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Categories as algebra: An essential ingredient in the theory of monoids
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- On Pointlike Sets and Joins of Pseudovarieties
- The Birkhoff theorem for finite algebras
- Profinite categories and semidirect products
- Profinite categories, implicit operations and pseudovarieties of categories
- Abelian pointlikes of a monoid
- Profinite semigroups, Mal'cev products, and identities
- Decidability of complexity one-half for finite semigroups
- Undecidability of the identity problem for finite semigroups
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- The pseudovariety $J$ is hyperdecidable
- ON A CLASS OF SEMIGROUP PSEUDOVARIETIES WITHOUT FINITE PSEUDOIDENTITY BASIS
- Product expansions
- On the hyperdecidability of semidirect products of pseudovarieties
Cited In (37)
- Iterated periodicity over finite aperiodic semigroups
- Extending partial automorphisms and the profinite topology on free groups
- On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)
- PROFINITE METHODS IN SEMIGROUP THEORY
- A delay theorem for pointlikes
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
- The geometry of profinite graphs with applications to free groups and finite monoids
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- On the hyperdecidability of semidirect products of pseudovarieties
- APERIODIC POINTLIKES AND BEYOND
- A profinite approach to stable pairs.
- COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
- 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 THE PSEUDOVARIETY LS1
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
- Reducibility vs. definability for pseudovarieties of semigroups
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- The pseudoidentity problem and reducibility for completely regular semigroups
- Some reducibility properties for pseudovarieties of the form \(DRH\)
- Dynamics of implicit operations and tameness of pseudovarieties of groups
- The \(\kappa\)-word problem over \(\mathsf{DRH}\)
- Reducibility of Joins Involving Some Locally Trivial Pseudovarieties
- The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin
- Krohn-Rhodes complexity pseudovarieties are not finitely based
- Tameness of Some Locally Trivial Pseudovarieties
- Complete κ-reducibility of pseudovarieties of the form DRH
- McCammond’s normal forms for free aperiodic semigroups revisited
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- The pseudovariety $J$ is hyperdecidable
- Finite state automata: a geometric approach
- STABLE PAIRS
- TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
- Semidirect product with an order-computable pseudovariety and tameness.
- SC-hyperdecidability of \(\mathbf R\)
- Tameness of pseudovariety joins involving R.
- Hyperdecidability of pseudovarieties of orthogroups
This page was built for publication: HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513299)
