{"id":"https://openalex.org/W2036501955","doi":"https://doi.org/10.1137/s0097539700366528","title":"Regular Languages are Testable with a Constant Number of Queries","display_name":"Regular Languages are Testable with a Constant Number of Queries","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2036501955","doi":"https://doi.org/10.1137/s0097539700366528","mag":"2036501955"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700366528","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700366528","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008556299","display_name":"Michael Krivelevich","orcid":"https://orcid.org/0000-0003-2357-4982"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Krivelevich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005870042","display_name":"Ilan Newman","orcid":"https://orcid.org/0000-0002-4845-4111"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilan Newman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113860564","display_name":"M\u00e1ri\u00f3 Szegedy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mario Szegedy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.9896,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.98817654,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"6","first_page":"1842","last_page":"1862"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.8453077673912048},{"id":"https://openalex.org/keywords/testability","display_name":"Testability","score":0.7210717797279358},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6427351832389832},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.585699737071991},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5522553324699402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5498936772346497},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.536581814289093},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4974723160266876},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4936729371547699},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4804077446460724},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4789598286151886},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.46220919489860535},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.436749666929245},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.4258446991443634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40235382318496704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25235670804977417},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.10685354471206665},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10309222340583801}],"concepts":[{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.8453077673912048},{"id":"https://openalex.org/C51234621","wikidata":"https://www.wikidata.org/wiki/Q2149495","display_name":"Testability","level":2,"score":0.7210717797279358},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6427351832389832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.585699737071991},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5522553324699402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5498936772346497},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.536581814289093},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4974723160266876},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4936729371547699},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4804077446460724},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4789598286151886},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.46220919489860535},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.436749666929245},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4258446991443634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40235382318496704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25235670804977417},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.10685354471206665},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10309222340583801},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s0097539700366528","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700366528","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.1276","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.1276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~krivelev/24conf.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.75","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.75","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~krivelev/24.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.3839","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.3839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.haifa.ac.il/ILAN/j-testing-regular.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.9115","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9115","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.haifa.ac.il/ILAN/testing-regular.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.4074","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.4074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~mdr/regular.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2006447612","https://openalex.org/W2018925011","https://openalex.org/W2095095818","https://openalex.org/W2148352980","https://openalex.org/W3008660429"],"related_works":["https://openalex.org/W2318718798","https://openalex.org/W2551865055","https://openalex.org/W2963363569","https://openalex.org/W2980711752","https://openalex.org/W4298661057","https://openalex.org/W2949229117","https://openalex.org/W2101930966","https://openalex.org/W2568243855","https://openalex.org/W57574355","https://openalex.org/W1486891341"],"abstract_inverted_index":{"We":[0,109],"continue":[1],"the":[2,112,123],"study":[3],"of":[4,23,57,92,114,137,141,151,160],"combinatorial":[5],"property":[6],"testing,":[7],"initiated":[8],"by":[9,134,163],"Goldreich,":[10],"Goldwasser,":[11],"and":[12,42,63,118],"Ron":[13],"in":[14,75,85,107,120],"[J.":[15],"ACM,":[16],"45":[17],"(1998),":[18],"pp.":[19],"653--750].":[20],"The":[21,87,139],"subject":[22],"this":[24],"paper":[25],"is":[26,33,97],"testing":[27,128,142],"regular":[28,38,143],"languages.":[29],"Our":[30],"main":[31],"result":[32],"as":[34,148],"follows.":[35],"For":[36],"a":[37,48,54,83,104,149,152],"language":[39],"$L\\in":[40],"\\{0,1\\}^*$":[41],"an":[43],"integer":[44],"n":[45,59],"there":[46],"exists":[47],"randomized":[49],"algorithm":[50,88],"which":[51],"always":[52],"accepts":[53],"word":[55,84],"w":[56,70],"length":[58],"if":[60,69],"$w\\in":[61],"L$":[62],"rejects":[64],"it":[65],"with":[66],"high":[67],"probability":[68],"has":[71],"to":[72,81,99,103,157],"be":[73,100,132,146],"modified":[74],"at":[76],"least":[77],"$\\epsilon":[78],"n$":[79],"positions":[80],"create":[82],"L.":[86],"queries":[89],"$\\tilde{O}(1/\\epsilon)$":[90],"bits":[91],"w.":[93],"This":[94],"query":[95,124],"complexity":[96,125],"shown":[98],"optimal":[101],"up":[102],"factor":[105],"polylogarithmic":[106],"$1/\\epsilon$.":[108],"also":[110],"discuss":[111],"testability":[113,159],"more":[115],"complex":[116],"languages":[117,130,144],"show,":[119],"particular,":[121],"that":[122],"required":[126],"for":[127],"context-free":[129],"cannot":[131],"bounded":[133],"any":[135],"function":[136],"$\\epsilon$.":[138],"problem":[140],"can":[145],"viewed":[147],"part":[150],"very":[153],"general":[154],"approach,":[155],"seeking":[156],"probe":[158],"properties":[161],"defined":[162],"logical":[164],"means.":[165]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}