scientific article; zbMATH DE number 2050939

zbMATH Open1103.68576MaRDI QIDQ4453214FDOQ4453214

Authors:

Publication date: 7 March 2004

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• Title not available (Why is that?)
• On generalized locally testable languages
• Reducing the time complexity of testing for local threshold testability
• Local testability from words to traces, a suitable definition
• Title not available (Why is that?)
• Two-Sided Strictly Locally Testable Languages
• 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)