Complete reducibility of systems of equations with respect to R.

DOI10.4171/PM/1792MaRDI QIDQ2479751zbMATH OpenOpenAlexFDO

Authors Jorge Almeida, José Carlos Costa, Marc Zeitoun

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

\(\mathcal R\)-trivial semigroupscomplete reducibilityimplicit signaturespseudowordsrational constraintsrelatively free profinite semigroupssystems of equations

Mathematics Subject Classification ID

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

Recommendations

• Complete reducibility of pseudovarieties.
• Reducibility vs. definability for pseudovarieties of semigroups
• Complete κ-reducibility of pseudovarieties of the form DRH
• On -reducibility of pseudovarieties of the form V D
• Pointlike reducibility of pseudovarieties of the form V* D.

Cited in

(18)

• Towards a pseudoequational proof theory
• Every decidable pseudovariety of abelian groups is completely tame
• Profinite topologies
• Recognizing pro-\(\mathrm{R}\) closures of regular languages
• Reducibility of pointlike problems
• Iterated periodicity over finite aperiodic semigroups
• Pointlike sets with respect to R and J.
• The pseudoidentity problem and reducibility for completely regular semigroups
• Factoriality and the Pin-Reutenauer procedure
• Complete κ-reducibility of pseudovarieties of the form DRH
• COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
• Some reducibility properties for pseudovarieties of the form DRH
• Closures of regular languages for profinite topologies.
• The pseudovariety of all nilpotent groups is tame
• Reducibility vs. definability for pseudovarieties of semigroups
• Complete reducibility of pseudovarieties.
• Pseudovarieties of semigroups
• An automata-theoretic approach to the word problem for \(\omega\)-terms over R

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)