Characterization of idempotent transformation monoids

https://doi.org/10.1016/0020-0190(89)90226-3Get rights and content

First page preview

First page preview
Click to open first page preview

References (8)

  • S.A. Cook

    The taxonomy of problems with fast parallel algorithms

    Inform. and Control

    (1985)
  • L. Babai et al.

    Permutation groups in NC

    Proc. 19th ACM Symp. on the Theory of Computing

    (1987)
  • M. Beaudry et al.

    Testing membership: Beyond permutation groups

    Proc. 6th Symp. on Theoretical Aspects of Computer Science

    (1989)
  • S. Eilenberg

    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 Science
  • Efficient simplicity testing of automata

    1992, Theoretical Computer Science
  • Finite idempotent groupoids and regular languages

    1998, Theoretical Informatics and Applications
View full text