{"id":"https://openalex.org/W2003628284","doi":"https://doi.org/10.1137/s0097539791216987","title":"Computing the Order of a Locally Testable Automaton","display_name":"Computing the Order of a Locally Testable Automaton","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2003628284","doi":"https://doi.org/10.1137/s0097539791216987","mag":"2003628284"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791216987","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791216987","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/A5032021351","display_name":"Sam M. Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sam M. Kim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004829018","display_name":"Robert McNaughton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert McNaughton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4645,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.60906369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"23","issue":"6","first_page":"1193","last_page":"1215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8751265406608582},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6945772767066956},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6646891236305237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5851472020149231},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5824583172798157},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5495913028717041},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5369081497192383},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5033840537071228},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.49537861347198486},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4825993776321411},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4367735981941223},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3943849802017212},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3228232264518738},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3047587275505066},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.28105324506759644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26027435064315796},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2230176031589508},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21619310975074768}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8751265406608582},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6945772767066956},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6646891236305237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5851472020149231},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5824583172798157},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5495913028717041},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5369081497192383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5033840537071228},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.49537861347198486},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4825993776321411},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4367735981941223},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3943849802017212},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3228232264518738},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3047587275505066},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.28105324506759644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26027435064315796},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2230176031589508},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21619310975074768},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539791216987","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791216987","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1554451661","https://openalex.org/W1655990431","https://openalex.org/W1997358966","https://openalex.org/W2010571644","https://openalex.org/W2075488055","https://openalex.org/W2118382442","https://openalex.org/W2130750623","https://openalex.org/W4242518833","https://openalex.org/W4301662502","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W339229586","https://openalex.org/W2359266116","https://openalex.org/W1486321980","https://openalex.org/W2750994780","https://openalex.org/W2003628284","https://openalex.org/W1929531822","https://openalex.org/W3164944417","https://openalex.org/W2463565893","https://openalex.org/W2616607200","https://openalex.org/W2963305382"],"abstract_inverted_index":{"A":[0],"locally":[1,89,132,163],"testable":[2,90,105,133,164],"language":[3,6,25,82],"is":[4,22,75,78,83,97,136,169,187,190],"a":[5,19,87,130,140,162,180,183],"with":[7],"the":[8,24,29,42,54,62,81,92,99,102,115,120,127,159,172,175],"property":[9],"that,":[10],"for":[11,72,146,179],"some":[12],"positive":[13],"integer":[14],"j,":[15,50,182],"whether":[16],"or":[17,61],"not":[18],"string":[20],"x":[21,34,47],"in":[23,56],"depends":[26],"on":[27,158],"(1)":[28],"prefix":[30],"and":[31,40,109,138,171],"suffix":[32],"of":[33,35,44,46,48,64,101,129,154,161,166,174,177],"length":[36,49],"$j":[37],"-":[38],"1$,":[39],"(2)":[41],"set":[43],"substrings":[45,59],"without":[51],"regard":[52],"to":[53,114],"order":[55,100,128,160],"which":[57,73],"these":[58,111],"occur":[60],"number":[63,95],"times":[65],"each":[66],"substring":[67],"occurs.":[68],"For":[69,86],"any":[70],"j":[71,84,96,188],"this":[74],"true,":[76],"it":[77],"said":[79],"that":[80,118,125],"-testable":[85,189],"given":[88,131,181,184],"language,":[91],"smallest":[93],"such":[94],"called":[98],"language.":[103],"Locally":[104],"languages":[106],"are":[107],"regular":[108],"therefore":[110],"concepts":[112],"apply":[113],"finite":[116],"automata":[117],"recognize":[119],"languages.":[121],"The":[122],"authors":[123],"show":[124],"computing":[126,147],"deterministic":[134,185],"automaton":[135,165,186],"NP-hard":[137],"present":[139],"polynomial-time":[141],"$":[142],"\\epsilon":[143],"$-approximation":[144],"algorithm":[145],"it.":[148],"In":[149],"addition,":[150],"an":[151],"upper":[152],"bound":[153],"$2n^2":[155],"+":[156],"1$":[157],"n":[167],"states":[168],"obtained,":[170],"co-NP-completeness":[173],"problem":[176],"whether,":[178],"proven.":[191]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}