{"id":"https://openalex.org/W1987322712","doi":"https://doi.org/10.1137/0219069","title":"A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata","display_name":"A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata","publication_year":1990,"publication_date":"1990-12-01","ids":{"openalex":"https://openalex.org/W1987322712","doi":"https://doi.org/10.1137/0219069","mag":"1987322712"},"language":"en","primary_location":{"id":"doi:10.1137/0219069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219069","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/A5011820318","display_name":"Cynthia Dwork","orcid":"https://orcid.org/0000-0001-7177-3738"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cynthia Dwork","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111558966","display_name":"Larry Stockmeyer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Larry Stockmeyer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4725,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.88704274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"6","first_page":"1011","last_page":"1023"},"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/T10142","display_name":"Formal Methods in Verification","score":0.996999979019165,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7172185182571411},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.709501326084137},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6517084240913391},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6397290229797363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6302547454833984},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5871871709823608},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5784042477607727},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5743409395217896},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.5629755854606628},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5479429364204407},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5390090346336365},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5269573330879211},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5126763582229614},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5063313245773315},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4936255216598511},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4508974552154541},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44824841618537903},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4435514807701111},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43814441561698914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2096771001815796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18492701649665833},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.16889098286628723},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10118809342384338},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05520123243331909}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7172185182571411},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.709501326084137},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6517084240913391},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6397290229797363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6302547454833984},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5871871709823608},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5784042477607727},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5743409395217896},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.5629755854606628},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5479429364204407},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5390090346336365},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5269573330879211},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5126763582229614},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5063313245773315},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4936255216598511},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4508974552154541},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44824841618537903},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4435514807701111},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43814441561698914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2096771001815796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18492701649665833},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.16889098286628723},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10118809342384338},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05520123243331909},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0219069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219069","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":11,"referenced_works":["https://openalex.org/W47137029","https://openalex.org/W1521651075","https://openalex.org/W1971842919","https://openalex.org/W1978405212","https://openalex.org/W2054801208","https://openalex.org/W2059442002","https://openalex.org/W2073696431","https://openalex.org/W2158396815","https://openalex.org/W2165469059","https://openalex.org/W2592184324","https://openalex.org/W4212875940"],"related_works":["https://openalex.org/W2139519154","https://openalex.org/W2525308864","https://openalex.org/W72746997","https://openalex.org/W2037872771","https://openalex.org/W2079577017","https://openalex.org/W2951815888","https://openalex.org/W2499762659","https://openalex.org/W2010706856","https://openalex.org/W2143754769","https://openalex.org/W3153637812"],"abstract_inverted_index":{"It":[0,77],"is":[1,25,54],"shown":[2],"that":[3,66],"if":[4],"a":[5,13,26,61,80,119],"two-way":[6,125],"probabilistic":[7],"finite-state":[8,127,135],"automaton":[9,128],"(2pfa)":[10],"M":[11,45],"recognizes":[12],"nonregular":[14,71],"language":[15,89],"L":[16],"with":[17],"error":[18],"probability":[19],"bounded":[20],"below":[21],"$\\frac{1}{2}$,":[22],"then":[23],"there":[24],"positive":[27],"constant":[28],"b":[29],"(depending":[30],"on":[31,46,108],"M)":[32],"such":[33],"that,":[34],"for":[35,84],"infinitely":[36],"many":[37],"inputs":[38],"x,":[39],"the":[40,55,109,113],"expected":[41,75],"running":[42],"time":[43,81],"of":[44,57,63,115],"input":[47],"x":[48],"must":[49],"exceed":[50],"$2^{n^{b}}$":[51],"where":[52],"n":[53],"length":[56],"x.":[58],"This":[59],"complements":[60],"result":[62],"Freivalds":[64],"showing":[65],"2pfa\u2019s":[67],"can":[68,90],"recognize":[69],"certain":[70],"languages":[72],"in":[73,96,112],"exponential":[74,103],"time.":[76,98],"also":[78],"establishes":[79],"complexity":[82],"gap":[83],"2pfa\u2019s,":[85],"since":[86],"any":[87],"regular":[88],"be":[91],"recognized":[92],"by":[93],"some":[94],"2pfa":[95,121],"linear":[97],"Other":[99],"results":[100],"give":[101],"roughly":[102],"upper":[104],"and":[105],"lower":[106],"bounds":[107],"worst-case":[110],"increase":[111],"number":[114],"states":[116],"when":[117],"converting":[118],"polynomial-time":[120],"to":[122,130],"an":[123,131],"equivalent":[124,132],"nondeterministic":[126],"or":[129],"one-way":[133],"deterministic":[134],"automaton.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}