A new algorithm for testing if a regular language is locally threshold testable
Information Processing Letters（2007）
摘要
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.
更多查看译文
关键词
new algorithm,threshold testable,proof idea,presburger arithmetic,correctness proof,regular language,formal language,formal languages
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要