|
|||||
|
|
A new algorithm for testing if a regular language is locally threshold testable |
|
| Authors: | Miko?aj Bojańczyk |
| Affiliation: | Institute of Informatics, Warsaw University, Poland |
| 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. |
| Keywords: | Formal languages |
| 本文献已被 ScienceDirect 等数据库收录！ | |