Some reducibility properties for pseudovarieties of the form DRH

DOI10.1080/00927872.2017.1360328zbMath1473.20060arXiv1512.01021OpenAlexW2259124089MaRDI QIDQ4567814

Célia Borlido

Publication date: 20 June 2018

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.01021

zbMATH Keywords

reducibilitypseudovarietygraph equation\(\mathcal R\)-classidempotent pointlike equationpointlike equation

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)

Related Items (1)

Complete κ-reducibility of pseudovarieties of the form DRH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tameness of pseudovariety joins involving R.
• An automata-theoretic approach to the word problem for \(\omega\)-terms over R
• Decidability of complexity one-half for finite semigroups
• Sur le produit de concatenation non ambigu
• Pointlike sets: the finest aperiodic cover of a finite semigroup
• Profinite semigroups, Mal'cev products, and identities
• Reducibility of pointlike problems
• Residual nilpotence and relations in free groups
• Complete reducibility of systems of equations with respect to \(\mathbf R\).
• Complexity of finite semigroups
• The pseudoidentity problem and reducibility for completely regular semigroups
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• APERIODIC POINTLIKES AND BEYOND
• Undecidability of the identity problem for finite semigroups
• Equations in free groups are not finitely approximable
• Defining Relations and the Algebraic Structure of the Group SL₂ over Integral Hamilton Quaternions
• The pseudovariety $J$ is hyperdecidable
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS

This page was built for publication: Some reducibility properties for pseudovarieties of the form DRH