Results 11 to 20 of about 302 (48)
Complete reducibility of pseudovarieties [PDF]
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.
Almeida, Jorge +2 more
core +1 more source
Free profinite R-trivial, locally idempotent and locally commutative semigroups [PDF]
This paper is concerned with the structure of implicit operations on R intersection with LJ1, the pseudovariety of all R-trivial, locally idempotent and locally commutative semigroups.
A. Azevedo +18 more
core +1 more source
In algebraic terms, the insertion of $n$-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality $1\le x^n$.
Almeida, J., Klíma, O.
core +1 more source
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids.
Klíma, Ondřej
core +2 more sources
Some operators that preserve the locality of a pseudovariety of semigroups
It is shown that if V is a local monoidal pseudovariety of semigroups, then K(m)V, D(m)V and LI(m)V are local. Other operators of the form Z(m)(_) are considered.
ALFREDO COSTA +5 more
core +1 more source
Some pseudovariety joins involving locally trivial semigroups and groups [PDF]
In this paper, we present the computation of some pseudovariety joins of the form LI v H v V where LI is the pseudovariety of locally trivial semigroups and H is any pseudovariety of groups.
Costa, José Carlos
core +1 more source
On FO2 quantifier alternation over words
We show that each level of the quantifier alternation hierarchy within FO^2[
H. Straubing +13 more
core +2 more sources
Three examples of join computations [PDF]
This article answers three questions of J. Almeida. Using combinatorial, algebraic and topological methods, we compute joins involving the pseudovariety of finite groups, the pseudovariety of semigroups in which each idempotent is a right zero and the ...
Azevedo, Assis, Zeitoun, Marc
core +2 more sources
Closures of regular languages for profinite topologies [PDF]
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 Moura +29 more
core +4 more sources
Tameness of pseudovariety joins involving R [PDF]
2000 Mathematics Subject Classification: 20M07 (primary); 20M05, 20M35, 68Q70 (secondary).In this paper, we establish several decidability results for pseudovariety joins of the form VvW, where V is a subpseudovariety of J or the pseudovariety R.
B Herwig +26 more
core +4 more sources

