Pages that link to "Item:Q4336094"
From MaRDI portal
The following pages link to Algorithms for computing finite semigroups (Q4336094):
Displayed 14 items.
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- Computing automorphisms of semigroups. (Q846358) (← links)
- On the groups of codes with empty kernel. (Q982209) (← links)
- Computing maximal subsemigroups of a finite semigroup (Q1645462) (← links)
- Enumeration of idempotents in planar diagram monoids (Q1712490) (← links)
- Computing finite semigroups (Q1757008) (← links)
- Application of max-plus algebra to biological sequence comparisons (Q1870593) (← links)
- Random ubiquitous transformation semigroups (Q2009658) (← links)
- The stylic monoid (Q2163861) (← links)
- Polynomial time multiplication and normal forms in free bands (Q2693634) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- A conjecture on the concatenation product (Q3147025) (← links)
- Commutative images of rational languages and the Abelian kernel of a monoid (Q3149083) (← links)
- An algebraic model for inversion and deletion in bacterial genome rearrangement (Q6112440) (← links)