scientific article; zbMATH DE number 2050939

MaRDI QIDQ4453214zbMATH OpenFDO

Authors

Publication date 7 March 2004

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Families of locally testable languages
• Reducing the time complexity of testing for local threshold testability
• Reducing the time complexity of testing for local threshold testability
• scientific article; zbMATH DE number 2081053
• Languages and scanners

Cited in

(7)

• scientific article; zbMATH DE number 2081053 (Why is no real title available?)
• scientific article; zbMATH DE number 1839456 (Why is no real title available?)
• Two-Sided Strictly Locally Testable Languages
• On generalized locally testable languages
• Local testability from words to traces, a suitable definition
• Reducing the time complexity of testing for local threshold testability
• On separation by locally testable and locally threshold testable languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453214)