Complete reducibility of systems of equations with respect to R

Almeida, Jorge; Costa, José Carlos; Zeitoun, Marc

doi:10.4171/pm/1792

Cited by 13 publications

(1 citation statement)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The assessed results for the Mn-X systems are presented in Fig. 9 compared with the experimental data [50,69,[91][92][93][94][95][96][97][98][99][100][101][102][103][104][105][106]. The Mn-X systems show an excellent agreement except that the assessed data for Mn-Tm is about 8% higher than the experimental data [101].…”

Section: 7mentioning

confidence: 90%

Assessments of molar volume of the binary C14 Laves phase

Zhao

Liu

2015

Calphad

View full text Add to dashboard Cite

Section: 7mentioning

confidence: 90%

Assessments of molar volume of the binary C14 Laves phase

Zhao

Liu

2015

Calphad

View full text Add to dashboard Cite

Closures of regular languages for profinite topologies

2014

View full text Add to dashboard Cite

Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure, to compute the closure in the free group of a regular language with respect to the Hall topology.A similar descriptive procedure is shown to hold for the pseudovariety A of aperiodic semigroups, where the closure is taken in the free aperiodic ω-semigroup. It is inherited by a subpseudovariety of a given pseudovariety if both of them enjoy the property of being full. The pseudovariety A, as well as some of its subpseudovarieties are shown to be full.The interest in such descriptions stems from the fact that, for each of the main pseudovarieties V in our examples, the closures of two regular languages are disjoint if and only if the languages can be separated by a language whose syntactic semigroup lies in V. In the cases of A and of the pseudovariety DA of semigroups in which all regular elements are idempotents, this is a new result.

show abstract

Reducibility of pointlike problems

2015

View full text Add to dashboard Cite

Abstract. We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of elements of a fixed set π of primes; the pseudovariety of all finite semigroups in which every regular J-class is the product of a rectangular band by a group from a fixed pseudovariety of groups that is reducible for the pointlike problem, respectively graph reducible. Allowing only trivial groups, we obtain ω-reducibility of the pointlike and idempotent pointlike problems, respectively for the pseudovarieties of all finite aperiodic semigroups (A) and of all finite semigroups in which all regular elements are idempotents (DA).

show abstract

Complete reducibility of systems of equations with respect to R

Cited by 13 publications

References 43 publications

Assessments of molar volume of the binary C14 Laves phase

Assessments of molar volume of the binary C14 Laves phase

Closures of regular languages for profinite topologies

Reducibility of pointlike problems

Contact Info

Product

Resources

About