@article {IOPORT.00065333,
    author       = {Zhang, Shuhua},
    title        = {Efficient simplicity testing of automata.},
    year         = {1992},
    journal      = {Theoretical Computer Science},
    volume       = {99},
    number       = {2},
    issn         = {0304-3975},
    pages        = {265-278},
    publisher    = {Elsevier Science Publishers, Amsterdam},
    doi          = {10.1016/0304-3975(92)90352-G},
    abstract     = {Summary: Let $V$ be a pseudovariety of finite semigroups; an automaton ${\cal A}=(X,\Sigma,M)$ is called $V$-type if the transformation semigroup of ${\cal A}$ belongs to $V$. Polynomial-time algorithms for testing whether an automaton ${\cal A}=(X,\Sigma,M)$ is $S$-type, $RS$-type, $LS$-type or $RS\lor LS$-type are given, where $S$, $RS$ and $LS$ denote, respectively, the pseudovarieties of all finite simple semigroups, all finite right simple semigroups and all finite left simple semigroups.},
    identifier   = {00065333},
}