Displaying 481 – 500 of 990

Showing per page

On graph products of automatic monoids

A. Veloso Da Costa (2001)

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

The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.

On graph products of automatic monoids

A. Veloso da Costa (2010)

RAIRO - Theoretical Informatics and Applications

The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.

On left C - 𝒰 -liberal semigroups

Yong He, Fang Shao, Shi-qun Li, Wei Gao (2006)

Czechoslovak Mathematical Journal

In this paper the equivalence 𝒬 ˜ U on a semigroup S in terms of a set U of idempotents in S is defined. A semigroup S is called a 𝒰 -liberal semigroup with U as the set of projections and denoted by S ( U ) if every 𝒬 ˜ U -class in it contains an element in U . A class of 𝒰 -liberal semigroups is characterized and some special cases are considered.

Currently displaying 481 – 500 of 990