Algorithms for computing finite semigroups

DOI10.1007/978-3-642-60539-0_9MaRDI QIDQ4336094zbMATH OpenOpenAlexFDO

Authors V. Froidure, Jean-Éric Pin

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

zbMATH Keywords

algorithmsfinite subsemigroupsGreen relationsreduced elements

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing finite semigroups
• Computing maximal subsemigroups of a finite semigroup
• Two variants of the Froidure-Pin algorithm for finite semigroups
• Computing transformation semigroups

Cited in

(35)

• 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?)
• scientific article; zbMATH DE number 1419254 (Why is no real title available?)
• 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.

Describes a project that uses

Uses Software

• Semigroupe

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)