Computing transformation semigroups

DOI10.1006/jsco.2000.0406zbMath1002.20043OpenAlexW2006000220MaRDI QIDQ1599539

R. Smith

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2000.0406

zbMATH Keywords

algorithmsGreen relationscomputationfinite transformation semigroupsgeneralized Schützenberger groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General structure theory for semigroups (20M10) Semigroups of transformations, relations, partitions, etc. (20M20) Representation of semigroups; actions of semigroups on sets (20M30)

Related Items

Multiscale Graph Grammars Can Generate Cayley Graphs of Groups and Monoids, Some contributions to the theory of transformation monoids, Groups that together with any transformation generate regular semigroups or idempotent generated semigroups., Computing finite semigroups, Mitigating covert channels based on analysis of the potential for communication, Two generalizations of homogeneity in groups with applications to regular semigroups, A general approach for generating sets of certain subsemigroups of monotone maps

Uses Software

• GAP
• MONOiD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the determination of Green's relations in finite transformation semigroups
• Groups and actions in transformation semigroups
• On the computational power of pushdown automata