scientific article; zbMATH DE number 2019622

zbMATH Open1028.68946MaRDI QIDQ4440425FDOQ4440425

Orna Kupferman, Hana Chockler

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830026.htm

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

Recommendations

• \(\omega\)-regular languages are testable with a constant number of queries
• Regular languages are testable with a constant number of queries
• Learning regular omega languages
• Testing membership in counter automaton languages
• Testing Membership in Languages that Have Small Width Branching Programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Randomized algorithms (68W20) Combinatorics on words (68R15)

Cited In (3)

• \(\omega\)-regular languages are testable with a constant number of queries
• Regular languages are testable with a constant number of queries
• Testing Membership in Languages that Have Small Width Branching Programs

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 Q4440425)