Algorithms for computing finite semigroups
From MaRDI portal
Publication:4336094
DOI10.1007/978-3-642-60539-0_9zbMath0876.20034OpenAlexW2107948742MaRDI QIDQ4336094
Publication date: 24 November 1997
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-60539-0_9
Symbolic computation and algebraic computation (68W30) Free semigroups, generators and relations, word problems (20M05)
Related Items
Computing automorphisms of semigroups., Computing maximal subsemigroups of a finite semigroup, The stylic monoid, An algebraic model for inversion and deletion in bacterial genome rearrangement, Polynomial time multiplication and normal forms in free bands, Recent results on syntactic groups of prefix codes., Enumeration of idempotents in planar diagram monoids, Computing finite semigroups, Random ubiquitous transformation semigroups, On the groups of codes with empty kernel., COMPAS - A Computing Package for Synchronization, A conjecture on the concatenation product, Commutative images of rational languages and the Abelian kernel of a monoid, Application of max-plus algebra to biological sequence comparisons
Uses Software
