Displaying 301 – 320 of 667

Showing per page

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 modular group algebras of p -mixed and p -splitting abelian Σ -groups

Peter Vassilev Danchev (2002)

Commentationes Mathematicae Universitatis Carolinae

Let G be a p -mixed abelian group and R is a commutative perfect integral domain of char R = p > 0 . Then, the first main result is that the group of all normalized invertible elements V ( R G ) is a Σ -group if and only if G is a Σ -group. In particular, the second central result is that if G is a Σ -group, the R -algebras isomorphism R A R G between the group algebras R A and R G for an arbitrary but fixed group A implies A is a p -mixed abelian Σ -group and even more that the high subgroups of A and G are isomorphic, namely, A G . Besides,...

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 301 – 320 of 667