| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428269 | Information Processing Letters | 2007 | 4 Pages |
Abstract
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is shorter. The proof idea is to restate the problem in Presburger arithmetic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
