Results 1 -
3 of
3
Computing Transformation Semigroups
- SUBMITTED TO JOURNAL OF SYMBOLIC COMPUTATION
"... This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action. They provide for local computations, concerning a single R-class, without computing the whole sem ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action. They provide for local computations, concerning a single R-class, without computing the whole semigroup, as well as for computing the global structure of the semigroup. The algorithms have been implemented in the share package MONOID within the GAP system for computational algebra.
ON FINITE PRESENTABILITY OF MONOIDS AND THEIR SCHÜTZENBERGER GROUPS
, 2000
"... The main result of this paper asserts that a monoid with finitely many left and right ideals is finitely presented if and only if all its Schützenberger groups are finitely presented. The most important part of the proof is a rewriting theorem, giving a presentation for a Schützenberger group, which ..."
Abstract
- Add to MetaCart
The main result of this paper asserts that a monoid with finitely many left and right ideals is finitely presented if and only if all its Schützenberger groups are finitely presented. The most important part of the proof is a rewriting theorem, giving a presentation for a Schützenberger group, which is similar to the Reidemeister-Schreier rewriting theorem for groups.
