Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DYCK LANGUAGE:
Reports tagged with Dyck language:
TR26-265 | 20th October 2026
Hadar Strauss

Near-Optimal Bounds for Testing Residual-String Equality and Parenthesis Languages

Residual-String Equality, denoted $\text{ResStringEq}$, is the property consisting of all pairs of strings over $\{0,1,*\}$ that are equal after deleting all `$*$' symbols from them. This property was first introduced by Fischer, Magniez, and Starikovskaya (SODA 2018), who used it to show a lower bound on testing the $\text{Dyck}$ languages, ... more >>>




ISSN 1433-8092 | Imprint