Piecewise testabiity.

Simon had proved thatA language is piecewise testable iff its syntactic monoid is J-trivial (meaning that distinct elements of monoid generate distinct ideals).

Stern modified these necessary and sufficient conditions and described a polynomial time algorithm to verify piecewise testability. The algorithm was implemented by Caron.

We use in our package an algorithm to verify piecewise testability of deterministic finite automaton of order O(n

We implement also an algorithm to verify piecewise testability of a finite semigroup of order O(n

next