{"id":"https://openalex.org/W72530425","doi":"https://doi.org/10.25596/jalc-2009-093","title":"A Technique for Proving Lower Bounds on the Size of Sweeping Automata","display_name":"A Technique for Proving Lower Bounds on the Size of Sweeping Automata","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W72530425","doi":"https://doi.org/10.25596/jalc-2009-093","mag":"72530425"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2009-093","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2009-093","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2009-093","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102046996","display_name":"Hing Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Leung, Hing","raw_affiliation_strings":["Department of Computer Science, New Mexico State University, Las Cruces, NM"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New Mexico State University, Las Cruces, NM","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102046996"],"corresponding_institution_ids":["https://openalex.org/I10052268"],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56438114,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/T12072","display_name":"Machine Learning and Algorithms","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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7899784445762634},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6876621246337891},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6802529096603394},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6011456847190857},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5537756085395813},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.512374758720398},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5034372210502625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4952322542667389},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4877972900867462},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.45025718212127686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42954155802726746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42276573181152344},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4212781488895416},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.4106893539428711},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.36903902888298035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33845967054367065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25223222374916077}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7899784445762634},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6876621246337891},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6802529096603394},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6011456847190857},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5537756085395813},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.512374758720398},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5034372210502625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4952322542667389},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4877972900867462},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.45025718212127686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42954155802726746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42276573181152344},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4212781488895416},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.4106893539428711},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.36903902888298035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33845967054367065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25223222374916077},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2009-093","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2009-093","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2009-093","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2009-093","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W110214102","https://openalex.org/W1505674733","https://openalex.org/W1534970688","https://openalex.org/W1555251244","https://openalex.org/W1603510456","https://openalex.org/W1990283467","https://openalex.org/W2034243894","https://openalex.org/W2079577017","https://openalex.org/W2085151919","https://openalex.org/W2090921231","https://openalex.org/W2091988401","https://openalex.org/W2149288970"],"related_works":["https://openalex.org/W2149288970","https://openalex.org/W2537940722","https://openalex.org/W2121894539","https://openalex.org/W1490895920","https://openalex.org/W2269685284","https://openalex.org/W2057384603","https://openalex.org/W1976338306","https://openalex.org/W2028798737","https://openalex.org/W2169203237","https://openalex.org/W3134046426","https://openalex.org/W2079577017","https://openalex.org/W2950563206","https://openalex.org/W124607232","https://openalex.org/W2565271321","https://openalex.org/W2127450347","https://openalex.org/W2004898185","https://openalex.org/W2031592188","https://openalex.org/W1997545301","https://openalex.org/W2234137645","https://openalex.org/W2030569822"],"abstract_inverted_index":{"A":[0],"sweeping":[1,33,56],"automaton":[2,8],"is":[3,63],"a":[4,40,64],"two-way":[5],"deterministic":[6],"finite":[7,23],"which":[9],"makes":[10],"turns":[11],"only":[12],"at":[13],"the":[14,44,53,79],"endmarkers.":[15],"Sipser":[16],"[12]":[17],"has":[18],"proved":[19],"that":[20,60],"one-way":[21],"nondeterministic":[22],"automata":[24],"can":[25],"be":[26],"exponentially":[27],"more":[28],"succinct":[29],"in":[30,46],"sizes":[31],"than":[32],"automata.":[34,57],"In":[35,70],"this":[36],"paper,":[37],"we":[38,72],"propose":[39],"technique":[41,62],"based":[42],"on":[43,52],"work":[45],"[6]":[47],"for":[48],"establishing":[49],"lower":[50,75],"bounds":[51],"size":[54],"of":[55,67],"We":[58],"show":[59],"Sipser's":[61],"special":[65],"case":[66],"our":[68],"method.":[69],"addition,":[71],"prove":[73],"two":[74],"bound":[76],"results":[77],"with":[78],"new":[80],"technique.":[81]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2016-06-24T00:00:00"}