Testing parenthesis languages

DOI10.1007/3-540-44666-4_29MaRDI QIDQ4780800zbMATH OpenFDO

Authors Michal Parnas, Dana Ron, Ronitt Rubinfeld

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2129/21290261

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Recommendations

• Testing membership in parenthesis languages
• Generation of positive and negative tests for parsers
• scientific article; zbMATH DE number 3858442
• Over testable languages
• scientific article; zbMATH DE number 3881894
• Languages based on structural local testability
• Syntax checking either way
• Syntax checking either way
• Automated Generation of Positive and Negative Tests for Parsers

Cited in

(9)

• Proofs of proximity for context-free languages and read-once branching programs
• Syntax checking either way
• A lower bound for testing juntas
• Recognizing well-parenthesized expressions in the streaming model
• Proofs of proximity for context-free languages and read-once branching programs
• Improved bounds for testing Dyck languages
• Testing membership in parenthesis languages
• Recognizing well-parenthesized expressions in the streaming model
• \(\omega\)-regular languages are testable with a constant number of queries

This page was built for publication: Testing parenthesis languages

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