A new algorithm for testing if a regular language is locally threshold testable

Mikolaj Bojanczyk. A new algorithm for testing if a regular language is locally threshold testable. Inf. Process. Lett., 104(3):91-94, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.