Complete reducibility of systems of equations with respect to \(\mathbf R\).

DOI10.4171/PM/1792zbMath1148.20042OpenAlexW4300658869MaRDI QIDQ2479751

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

zbMATH Keywords

systems of equationsimplicit signaturesrelatively free profinite semigroupscomplete reducibilityrational constraints\(\mathcal R\)-trivial semigroupspseudowords

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (12)

Reducibility of pointlike problems ⋮ Reducibility vs. definability for pseudovarieties of semigroups ⋮ Some reducibility properties for pseudovarieties of the form DRH ⋮ Recognizing pro-\(\mathrm{R}\) closures of regular languages ⋮ Iterated periodicity over finite aperiodic semigroups ⋮ Complete κ-reducibility of pseudovarieties of the form DRH ⋮ Closures of regular languages for profinite topologies. ⋮ Towards a pseudoequational proof theory ⋮ Pointlike sets with respect to R and J. ⋮ Every decidable pseudovariety of abelian groups is completely tame ⋮ The pseudovariety of all nilpotent groups is tame ⋮ Profinite topologies

This page was built for publication: Complete reducibility of systems of equations with respect to \(\mathbf R\).