Computing transformation semigroups
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- Groups and actions in transformation semigroups
- On the computational power of pushdown automata
- On the determination of Green's relations in finite transformation semigroups
Cited in
(14)- Computing finite semigroups
- Mitigating covert channels based on analysis of the potential for communication
- Codecomposition of a transformation semigroup.
- A general approach for generating sets of certain subsemigroups of monotone maps
- Enumerating transformation semigroups
- Computing character tables and Cartan matrices of finite monoids with fixed point counting
- A Method for Constructing Square Roots in Finite Full Transformation Semigroups
- Multiscale graph grammars can generate Cayley graphs of groups and monoids
- Two variants of the Froidure-Pin algorithm for finite semigroups
- Two generalizations of homogeneity in groups with applications to regular semigroups
- scientific article; zbMATH DE number 3867604 (Why is no real title available?)
- Some contributions to the theory of transformation monoids
- Groups that together with any transformation generate regular semigroups or idempotent generated semigroups.
- Computing with semigroups in GAP. -- A tutorial
This page was built for publication: Computing transformation semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599539)