arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.06606cs.DS
收藏

Dyck语言测试的改进界

Improved bounds for testing Dyck languages

Technion - Israel Institute of Technology(以色列理工学院);CNRS, IRIF, Univ Paris Diderot(法国国家科学研究中心,IRIF,巴黎第七大学)

Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya

AI总结:

本文针对Dyck语言属性测试的上下界,将其n的幂次分别改进为大于2/5(上界)和1/5(下界),引入递归技术与Truestring Equivalence问题完成相关推导。

摘要:

本文研究Dyck语言的成员判定问题,Dyck语言是由平衡括号串构成的基础上下文无关语言族。给定长度为n、含m种括号类型的字符串,需判定其是否平衡。我们在属性测试框架下研究该问题,旨在通过尽可能少查询输入字符完成判定。对于m=1的Dyck语言成员测试,Alon、Krivelevich、Newman和Szegedy(SICOMP 2001)给出了查询数与输入规模n无关的测试方法;对于m≥2的情况,Parnas、Ron和Rubinfeld(RSA 2003)首次开展研究,他们给出了区分属于该语言的字符串与距离(汉明距离)该语言较远的字符串的上下界,分别为(多对数因子范围内)输入规模n的2/3次方和1/11次方。本文改进了这两个界中n的幂次:对于上界,我们引入一种递归技术,结合对原始工作方法的改进,得到了适用于任意大于2/5的n的幂次的测试方法;对于下界,我们引入了名为Truestring Equivalence的新问题,该问题可轻易归约为2类Dyck语言的属性测试问题,我们证明该新问题的下界为n的1/5次方。

英文摘要:

In this paper we consider the problem of deciding membership in Dyck languages, a fundamental family of context-free languages, comprised of well-balanced strings of parentheses. In this problem we are given a string of length $n$ in the alphabet of parentheses of $m$ types and must decide if it is well-balanced. We consider this problem in the property testing setting, where one would like to make the decision while querying as few characters of the input as possible. Property testing of strings for Dyck language membership for $m=1$, with a number of queries independent of the input size $n$, was provided in [Alon, Krivelevich, Newman and Szegedy, SICOMP 2001]. Property testing of strings for Dyck language membership for $m \ge 2$ was first investigated in [Parnas, Ron and Rubinfeld, RSA 2003]. They showed an upper bound and a lower bound for distinguishing strings belonging to the language from strings that are far (in terms of the Hamming distance) from the language, which are respectively (up to polylogarithmic factors) the $2/3$ power and the $1/11$ power of the input size $n$. Here we improve the power of $n$ in both bounds. For the upper bound, we introduce a recursion technique, that together with a refinement of the methods in the original work provides a test for any power of $n$ larger than $2/5$. For the lower bound, we introduce a new problem called Truestring Equivalence, which is easily reducible to the $2$-type Dyck language property testing problem. For this new problem, we show a lower bound of $n$ to the power of $1/5$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑