Mikolaj Bojanczyk. A new algorithm for testing if a regular language is locally threshold testable. Inf. Process. Lett., 104(3):91-94, 2007. [doi]
@article{Bojanczyk07-0,
title = {A new algorithm for testing if a regular language is locally threshold testable},
author = {Mikolaj Bojanczyk},
year = {2007},
doi = {10.1016/j.ipl.2007.05.015},
url = {http://dx.doi.org/10.1016/j.ipl.2007.05.015},
tags = {testing},
researchr = {https://researchr.org/publication/Bojanczyk07-0},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {104},
number = {3},
pages = {91-94},
}