{"id":"https://openalex.org/W2294025341","doi":"https://doi.org/10.25596/jalc-2009-023","title":"Lower Bounds on the Size of Sweeping Automata","display_name":"Lower Bounds on the Size of Sweeping Automata","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2294025341","doi":"https://doi.org/10.25596/jalc-2009-023","mag":"2294025341"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.5324","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.5324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.thi.informatik.uni-frankfurt.de/~georg/two-way2.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2009-023","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088678782","display_name":"Juraj Hromkovic\u0306","orcid":"https://orcid.org/0000-0001-9754-7042"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Hromkovi\u010d, Juraj","raw_affiliation_strings":["Department of Computer Science, ETH Zurich, ETH Zentrum, Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, ETH Zentrum, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025007932","display_name":"Georg Schnitger","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schnitger, Georg","raw_affiliation_strings":["Institute of Computer Science, Johann Wolfgang Goethe Universit\u00e4t, Frankfurt a. M., Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Johann Wolfgang Goethe Universit\u00e4t, Frankfurt a. M., Germany#TAB#","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3472,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65571112,"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.9991999864578247,"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.9975000023841858,"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-algorithm","display_name":"Nondeterministic algorithm","score":0.780825138092041},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.7491098046302795},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7464699745178223},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6921055316925049},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.6660041213035583},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6250948905944824},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6084468364715576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5811333656311035},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.47456151247024536},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.45981889963150024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43244653940200806},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3491891622543335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3448490500450134},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3429275453090668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34155529737472534},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2921827435493469}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.780825138092041},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.7491098046302795},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7464699745178223},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6921055316925049},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.6660041213035583},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6250948905944824},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6084468364715576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5811333656311035},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.47456151247024536},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.45981889963150024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43244653940200806},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3491891622543335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3448490500450134},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3429275453090668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34155529737472534},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2921827435493469}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.5324","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.5324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.thi.informatik.uni-frankfurt.de/~georg/two-way2.pdf","raw_type":"text"},{"id":"doi:10.25596/jalc-2009-023","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2009-023","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":null,"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-023","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2009-023","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":null,"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1505674733","https://openalex.org/W1555251244","https://openalex.org/W1589805592","https://openalex.org/W1603510456","https://openalex.org/W1971083528","https://openalex.org/W1971747251","https://openalex.org/W1981823970","https://openalex.org/W1990283467","https://openalex.org/W2002501531","https://openalex.org/W2034243894","https://openalex.org/W2040161039","https://openalex.org/W2072453354","https://openalex.org/W2085151919","https://openalex.org/W2090921231","https://openalex.org/W2091988401","https://openalex.org/W2095282951","https://openalex.org/W2142151475","https://openalex.org/W2149288970","https://openalex.org/W2340787257"],"related_works":["https://openalex.org/W2997238742","https://openalex.org/W1069688093","https://openalex.org/W2756180352","https://openalex.org/W185868636","https://openalex.org/W1520221852","https://openalex.org/W2280742385","https://openalex.org/W1738746856","https://openalex.org/W2973197960","https://openalex.org/W1533814670","https://openalex.org/W153129168","https://openalex.org/W40619283","https://openalex.org/W1972285175","https://openalex.org/W1966076725","https://openalex.org/W2604729131","https://openalex.org/W2112175063","https://openalex.org/W2963979500","https://openalex.org/W2950539409","https://openalex.org/W2398944522","https://openalex.org/W2949861521","https://openalex.org/W160566843"],"abstract_inverted_index":{"A":[0],"deterministic":[1,7],"sweeping":[2,35,42,81],"automaton":[3,8,43],"is":[4,62],"a":[5,25],"two-way":[6],"(2-DFA)":[9],"which":[10],"makes":[11],"turns":[12],"only":[13],"at":[14,51,63],"the":[15,21,32,45,56,69,78],"left":[16],"or":[17],"right":[18],"end":[19],"of":[20,34,60,80],"input.":[22],"We":[23,37],"give":[24],"survey":[26],"on":[27,77],"recent":[28],"lower":[29,75],"bounds":[30,76],"for":[31,44],"conciseness":[33,79],"automata.":[36,82],"also":[38],"show":[39],"that":[40],"any":[41],"language":[46],"$(L\\$)^*$":[47],"has":[48],"to":[49,73],"have":[50],"least":[52,64],"$\\sqrt{m/2}$":[53],"states":[54],"whenever":[55],"nondeterministic":[57],"message":[58],"complexity":[59],"$L$":[61],"$m$.":[65],"Thus":[66],"we":[67],"obtain":[68],"first":[70],"general":[71],"method":[72],"establish":[74]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}