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

Authors:
Mikołaj Bojańczyk
Affiliations:
Institute of Informatics, Warsaw University, Poland
Venue:
Information Processing Letters
Year:
2007

Citing 4
Cited 2

Languages and scanners

Theoretical Computer Science
On Context-Free Languages

Journal of the ACM (JACM)
Factors of Words

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming

A Decidable Characterization of Locally Testable Tree Languages

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Regular tree languages definable in FO and in FOmod

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.89

Visualization

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.