The following pages link to (Q4780800):
Displaying 7 items.
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Syntax checking either way (Q2164743) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- Recognizing well-parenthesized expressions in the streaming model (Q2875152) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- Testing membership in parenthesis languages (Q4798183) (← links)