Complete reducibility of systems of equations with respect to R.
DOI10.4171/PM/1792zbMATH Open1148.20042OpenAlexW4300658869MaRDI QIDQ2479751FDOQ2479751
José Carlos Costa, Marc Zeitoun, Jorge Almeida
Publication date: 3 April 2008
Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/pm/1792
Recommendations
- Complete reducibility of pseudovarieties.
- Reducibility vs. definability for pseudovarieties of semigroups
- Complete κ-reducibility of pseudovarieties of the form DRH
- On \(\kappa\)-reducibility of pseudovarieties of the form \(V \ast D\)
- Pointlike reducibility of pseudovarieties of the form \(\mathbf V*\mathbf D\).
complete reducibilitysystems of equationsrational constraints\(\mathcal R\)-trivial semigroupsimplicit signaturespseudowordsrelatively free profinite semigroups
Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (13)
- Iterated periodicity over finite aperiodic semigroups
- Towards a pseudoequational proof theory
- Every decidable pseudovariety of abelian groups is completely tame
- Reducibility of pointlike problems
- Reducibility vs. definability for pseudovarieties of semigroups
- The pseudoidentity problem and reducibility for completely regular semigroups
- The pseudovariety of all nilpotent groups is tame
- Pointlike sets with respect to R and J.
- Closures of regular languages for profinite topologies.
- Complete κ-reducibility of pseudovarieties of the form DRH
- Recognizing pro-\(\mathrm{R}\) closures of regular languages
- Profinite topologies
- Some reducibility properties for pseudovarieties of the form DRH
This page was built for publication: Complete reducibility of systems of equations with respect to \(\mathbf R\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479751)
