Characterization of idempotent transformation monoids
References (8)
The taxonomy of problems with fast parallel algorithms
Inform. and Control
(1985)- et al.
Permutation groups in NC
Proc. 19th ACM Symp. on the Theory of Computing
(1987) - et al.
Testing membership: Beyond permutation groups
Proc. 6th Symp. on Theoretical Aspects of Computer Science
(1989) Automata, Languages and Machines, Vol. B
(1976)
There are more references available in the full text version of this article.
Cited by (5)
Bilateral locally testable languages
2003, Theoretical Computer ScienceEfficient simplicity testing of automata
1992, Theoretical Computer ScienceComplete semigroups of binary relations defined by elementary and nodal x-semilattices of unions
2002, Journal of Mathematical SciencesFinite idempotent groupoids and regular languages
1998, Theoretical Informatics and ApplicationsThe Membership Problem in Aperiodic Transformation Monoids
1992, Journal of the ACM (JACM)
Copyright © 1989 Published by Elsevier B.V.