All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 4 Next

Displaying 61 – 80 of 183

Showing per page

Commutation of operations and its relationship with Menger and Mann superpositions

Fedir M. Sokhatsky (2004)

Discussiones Mathematicae - General Algebra and Applications

The article considers a problem from Trokhimenko paper [13] concerning the study of abstract properties of commutations of operations and their connection with the Menger and Mann superpositions. Namely, abstract characterizations of some classes of operation algebras, whose signature consists of arbitrary families of commutations of operations, Menger and Mann superpositions and their various connections are found. Some unsolved problems are given at the end of the article.

Commutative images of rational languages and the abelian kernel of a monoid

Manuel Delgado (2001)

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

Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification of the algorithm...

Commutative images of rational languages and the Abelian kernel of a monoid

Manuel Delgado (2010)

RAIRO - Theoretical Informatics and Applications

Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification of the algorithm...

Commutative monoids with zero-divisors

J. C. Rosales (2002)

Bollettino dell'Unione Matematica Italiana

We describe algorithms for computing the nilradical and the zero-divisors of a finitely generated commutative ∅ -monoid. These algorithms will be used for deciding if a given ideal of a finitely generated commutative ∅ -monoid is prime, radical or primary.

Currently displaying 61 – 80 of 183