Polynomial time multiplication and normal forms in free bands
From MaRDI portal
Recommendations
Cites work
- A Noetherian and confluent rewrite system for idempotent semigroups
- A practical method for enumerating cosets of a finite abstract group
- Algorithms for computing finite semigroups
- All varieties of bands
- An optimal algorithm for computing the repetitions in a word
- Band monoid languages revisited
- Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
- Computing finite semigroups
- Efficient testing of equivalence of words in a free idempotent semigroup
- Every group is a maximal subgroup of the free idempotent generated semigroup over a band.
- Homogeneous bands
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3217047 (Why is no real title available?)
- scientific article; zbMATH DE number 3071073 (Why is no real title available?)
- Minimisation of acyclic deterministic automata in linear time
- Rewriting in varieties of idempotent semigroups
- The lattice of equational classes of idempotent semigroups
- THE QUIVER OF THE SEMIGROUP ALGEBRA OF A LEFT REGULAR BAND
- Trees, band monoids and formal languages
- Varieties of Bands Revisited
- Varieties of idempotent semigroups
Cited in
(2)
This page was built for publication: Polynomial time multiplication and normal forms in free bands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693634)