Construction of an effective algorithm to find the isomorphism of two simple finite semigroups

DOI10.1007/BF01068686zbMath0644.68065OpenAlexW2093798721MaRDI QIDQ3787485

V. A. Makarenko

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068686

zbMATH Keywords

isomorphismeffective algorithmsimple finite semigroups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Finding the isomorphisms of 0-simple semigroups

Cites Work

• Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
• A general theory of translation
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of an effective algorithm to find the isomorphism of two simple finite semigroups