Page 1 Next

Displaying 1 – 20 of 252

Showing per page

A classification of rational languages by semilattice-ordered monoids

Libor Polák (2004)

Archivum Mathematicum

We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational languages correspond to the pseudovarieties of finite semilattice-ordered monoids. Taking complements of members of a conjunctive variety of languages we get a so-called disjunctive variety. We present here a non-trivial example of such a variety together with an equational characterization of the corresponding pseudovariety.

A conjecture on the concatenation product

Jean-Eric Pin, Pascal Weil (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal’cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general case. Another...

A conjecture on the concatenation product

Jean-Eric Pin, Pascal Weil (2010)

RAIRO - Theoretical Informatics and Applications

In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal'cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general case....

A multiplication of e -varieties of orthodox semigroups

Martin Kuřil (1995)

Archivum Mathematicum

We define semantically a partial multiplication on the lattice of all e–varieties of regular semigroups. In the case that the first factor is an e–variety of orthodox semigroups we describe our multiplication syntactically in terms of biinvariant congruences.

A new algebraic invariant for weak equivalence of sofic subshifts

Laura Chaubard, Alfredo Costa (2008)

RAIRO - Theoretical Informatics and Applications

It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. The main tool are ζ-semigroups, considered as recognition structures for sofic subshifts. A new algebraic invariant is obtained for weak equivalence of sofic subshifts, by determining which classes of sofic subshifts naturally defined by pseudovarieties of finite semigroups are closed under weak equivalence. Among such classes are the classes of almost finite type subshifts...

A note on orthodox additive inverse semirings

M. K. Sen, S. K. Maity (2004)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

We show in an additive inverse regular semiring ( S , + , · ) with E ( S ) as the set of all multiplicative idempotents and E + ( S ) as the set of all additive idempotents, the following conditions are equivalent: (i) For all e , f E ( S ) , e f E + ( S ) implies f e E + ( S ) . (ii) ( S , · ) is orthodox. (iii) ( S , · ) is a semilattice of groups. This result generalizes the corresponding result of regular ring.

A semilattice of varieties of completely regular semigroups

Mario Petrich (2020)

Mathematica Bohemica

Completely regular semigroups are unions of their (maximal) subgroups with the unary operation within their maximal subgroups. As such they form a variety whose lattice of subvarieties is denoted by ( 𝒞 ) . We construct a 60-element -subsemilattice and a 38-element sublattice of ( 𝒞 ) . The bulk of the paper consists in establishing the necessary joins for which it uses Polák’s theorem.

All completely regular elements in H y p G ( n )

Ampika Boonmee, Sorasak Leeratanavalee (2013)

Discussiones Mathematicae - General Algebra and Applications

In Universal Algebra, identities are used to classify algebras into collections, called varieties and hyperidentities are use to classify varieties into collections, called hypervarities. The concept of a hypersubstitution is a tool to study hyperidentities and hypervarieties. Generalized hypersubstitutions and strong identities generalize the concepts of a hypersubstitution and of a hyperidentity, respectively. The set of all generalized hypersubstitutions forms a monoid. In...

Currently displaying 1 – 20 of 252

Page 1 Next