论文信息 - A new algorithm for testing if a regular language is locally threshold testable

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

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.

Mikolaj Bojanczyk

[1] Danièle Beauquier,et al. Factors of Words , 1989, ICALP.

[2] Howard Straubing,et al. FINITE SEMIGROUP VARIETIES OF THE FORM V,D , 1985 .

[3] Denis Thérien,et al. Graph congruences and wreath products , 1985 .

[4] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[5] Danièle Beauquier,et al. Languages and Scanners , 1991, Theor. Comput. Sci..

[6] Jean-Éric Pin. Expressive power of existential first-order sentences of Bu"chi's sequential calculus , 2005, Discret. Math..

[7] Jean-Éric Pin,et al. The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus , 1996, ICALP.