The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 201 – 220 of 389

Showing per page

On the decidability of semigroup freeness

Julien Cassaigne, Francois Nicolas (2012)

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

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability...

On the decidability of semigroup freeness∗

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

On the maximal subsemigroups of the semigroup of all monotone transformations

Iliya Gyudzhenov, Ilinka Dimitrova (2006)

Discussiones Mathematicae - General Algebra and Applications

In this paper we consider the semigroup Mₙ of all monotone transformations on the chain Xₙ under the operation of composition of transformations. First we give a presentation of the semigroup Mₙ and some propositions connected with its structure. Also, we give a description and some properties of the class J ̃ n - 1 of all monotone transformations with rank n-1. After that we characterize the maximal subsemigroups of the semigroup Mₙ and the subsemigroups of Mₙ which are maximal in J ̃ n - 1 .

Currently displaying 201 – 220 of 389