Results 1 
5 of
5
Tameness of pseudovariety joins involving R
, 2004
"... In this paper, we establish several decidability results for pseudovariety joins of the form V ∨ W, where V is a subpseudovariety of J or the pseudovariety R. Here, J (resp. R) denotes the pseudovariety of all Jtrivial (resp. Rtrivial) semigroups. In particular, we show that the pseudovariety V ∨ ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
In this paper, we establish several decidability results for pseudovariety joins of the form V ∨ W, where V is a subpseudovariety of J or the pseudovariety R. Here, J (resp. R) denotes the pseudovariety of all Jtrivial (resp. Rtrivial) semigroups. In particular, we show that the pseudovariety V ∨ W is (completely) κtame when V is a subpseudovariety of J and W is (completely) κtame. Moreover, if W is a κtame pseudovariety which satisfies the pseudoidentity x1 · · · xry ω+1 zt ω = x1 · · · xryzt ω, then we prove that R ∨ W is also κtame. In particular the joins R ∨ Ab, R ∨ G, R ∨ OCR, and R ∨ CR are decidable.
Complete reducibility of systems of equations with respect to R
"... It is shown that the pseudovariety R of all finite Rtrivial semigroups is completely reducible with respect to the canonical signature. Informally, if the variables in a finite system of equations with rational constraints may be evaluated by pseudowords so that each value belongs to the closure of ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
It is shown that the pseudovariety R of all finite Rtrivial semigroups is completely reducible with respect to the canonical signature. Informally, if the variables in a finite system of equations with rational constraints may be evaluated by pseudowords so that each value belongs to the closure of the corresponding rational constraint and the system is verified in R, then there is some such evaluation which is “regular”, that is one in which, additionally, the pseudowords only involve multiplications and ωpowers.
THE EQUATIONAL THEORY OF ωTERMS FOR FINITE Rtrivial Semigroups
, 2005
"... A new topological representation for free profinite Rtrivial semigroups in terms of spaces of vertexlabeled complete binary trees is obtained. Such a tree may be naturally folded into a finite automaton if and only if the element it represents is an ωterm. The variety of ωsemigroups generated by ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A new topological representation for free profinite Rtrivial semigroups in terms of spaces of vertexlabeled complete binary trees is obtained. Such a tree may be naturally folded into a finite automaton if and only if the element it represents is an ωterm. The variety of ωsemigroups generated by all finite Rtrivial semigroups, with the usual interpretation of the ωpower, is then studied. A simple infinite basis of identities is exhibited and a lineartime solution of the word problem for relatively free ωsemigroups is presented. This work is also compared with recent work of Bloom and Choffrut on transfinite words.
Profinite semigroups and applications
 IN STRUCTURAL THEORY OF AUTOMATA, SEMIGROUPS, AND UNIVERSAL ALGEBRA
, 2003
"... Profinite semigroups may be described shortly as projective limits of finite semigroups. They come about naturally by studying pseudovarieties of finite semigroups which in turn serve as a classifying tool for rational languages. Of particular relevance are relatively free profinite semigroups which ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Profinite semigroups may be described shortly as projective limits of finite semigroups. They come about naturally by studying pseudovarieties of finite semigroups which in turn serve as a classifying tool for rational languages. Of particular relevance are relatively free profinite semigroups which for pseudovarieties play the role of free algebras in the theory of varieties. Combinatorial problems on rational languages translate into algebraictopological problems on profinite semigroups. The aim of these lecture notes is to introduce these topics and to show how they intervene in the most recent developments in the area.
COMPLETE REDUCIBILITY OF PSEUDOVARIETIES
"... Abstract. The notion of reducibility for a pseudovariety has been introduced as an abstract property which may be used to prove decidability results for various pseudovariety constructions. This paper is a survey of recent results establishing this and the stronger property of complete reducibility ..."
Abstract
 Add to MetaCart
Abstract. The notion of reducibility for a pseudovariety has been introduced as an abstract property which may be used to prove decidability results for various pseudovariety constructions. This paper is a survey of recent results establishing this and the stronger property of complete reducibility for specific pseudovarieties. 1.