Testing membership in parenthesis languages
From MaRDI portal
Publication:4798183
DOI10.1002/rsa.10067zbMath1057.68050OpenAlexW2092091787MaRDI QIDQ4798183
Ronitt Rubinfeld, Dana Ron, Michal Parnas
Publication date: 19 March 2003
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10067
Related Items (5)
Quantum algorithm for Dyck language with multiple types of brackets ⋮ Hierarchy theorems for property testing ⋮ Distribution-free connectivity testing for sparse graphs ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Hierarchy Theorems for Property Testing
Cites Work
This page was built for publication: Testing membership in parenthesis languages