Algorithms for computing finite semigroups
The authors give a simple algorithm which computes the finite subsemigroup \(M\) generated by a given set \(A\) in a large semigroup \(U\) called the universe. The algorithm constructs a complete list of reduced elements of \(M\) and rewrite rules for \(M\). The list is initialized as the singleton with the empty word. For each element \(u\) of the list being computed and for \(a\in A\), it computes \(u\cdot a\) in \(U\). If its value \(v\) already exists in the list, it produces the rule \(ua\to v\). Otherwise it adds the new element \(v\) to the list. They also give an improved version of the algorithm and apply it to compute the Green relations etc. For the entire collection see [Zbl 0857.00037].
- AUTOMATE, a computing package for automata and finite semigroups
- Computing finite commutative semigroups. II.
- Computing transformation semigroups
- Computing maximal subsemigroups of a finite semigroup
- Enumeration of idempotents in planar diagram monoids
- Computing finite semigroups
- Application of max-plus algebra to biological sequence comparisons
- Random ubiquitous transformation semigroups
- DLP in semigroups: algorithms and lower bounds
- The stylic monoid
- Two variants of the Froidure-Pin algorithm for finite semigroups
- Polynomial time multiplication and normal forms in free bands
- Semigroups of RN-algorithms
- COMPAS -- a computing package for synchronization
- A conjecture on the concatenation product
- Commutative images of rational languages and the Abelian kernel of a monoid
- scientific article; zbMATH DE number 3859412 (Why is no real title available?)
- scientific article; zbMATH DE number 3970684 (Why is no real title available?)
- scientific article; zbMATH DE number 4071228 (Why is no real title available?)
- scientific article; zbMATH DE number 59506 (Why is no real title available?)
- Recent results on syntactic groups of prefix codes.
- scientific article; zbMATH DE number 1897026 (Why is no real title available?)
- Algorithmic problems for finite groups and finite semigroups
- Algorithms for generalized numerical semigroups
- An algebraic model for inversion and deletion in bacterial genome rearrangement
- The Todd-Coxeter algorithm for semigroups and monoids
- Minimum transformation representations of diagram monoids
- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages
- A first taste of MeSCaL, a tool for solving membership problems for regular languages
- Minimal generating sets for matrix monoids
- Computing finite index congruences of finitely presented semigroups and monoids
- Computing automorphisms of semigroups.
- Computing finite semigroups. I: The first row.
- Computing finite semigroups. II: The first nonconstant row
- On the groups of codes with empty kernel.
This page was built for publication: Algorithms for computing finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336094)