Regular Languages are Testable with a Constant Number of Queries-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Regular Languages are Testable with a Constant Number of Queries

Published:2001-01 Issue:6 Volume:30 Page:1842-1862
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Alon Noga,Krivelevich Michael,Newman Ilan,Szegedy Mario

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/S0097539700366528

Reference6 articles.

1. Efficient Testing of Large Graphs

2. Proof verification and the hardness of approximation problems

3. Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius

4. JohnHopcroft, JeffreyUllman, Wprowadzenie do teorii automatów, języków i obliczeń, Wydawnictwo Naukowe PWN, Warsaw, 1994, 480–0, Translated from the 1979 English original by Beata Konikowska99a:68001

5. A Bound for a Solution of a Linear Diophantine Problem

Cited by 72 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Testing membership for timed automata;Acta Informatica;2023-07-17

2. Dynamic Race Detection with O(1) Samples;Proceedings of the ACM on Programming Languages;2023-01-09

3. Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error;ACM Transactions on Computation Theory;2022-03-23

4. A Quantum Query Complexity Trichotomy for Regular Languages;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11

5. Efficient Removal Lemmas for Matrices;Order;2019-05-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP