{"id":"https://openalex.org/W2056382040","doi":"https://doi.org/10.1137/0210027","title":"Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata","display_name":"Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata","publication_year":1981,"publication_date":"1981-05-01","ids":{"openalex":"https://openalex.org/W2056382040","doi":"https://doi.org/10.1137/0210027","mag":"2056382040"},"language":"en","primary_location":{"id":"doi:10.1137/0210027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210027","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/A5104946959","display_name":"Juris Hartmanis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Hartmanis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113062934","display_name":"Stephen R. Mahaney","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Mahaney","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":0.0,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.21247357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"2","first_page":"383","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9972000122070312,"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":0.9972000122070312,"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.9818999767303467,"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.888683557510376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.585228443145752},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5469735264778137},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49878597259521484},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.48007068037986755},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45877158641815186},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4545329213142395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4432596266269684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44266897439956665},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43521690368652344},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4186769723892212},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34065890312194824},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3333923816680908},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2632269561290741}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.888683557510376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.585228443145752},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5469735264778137},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49878597259521484},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.48007068037986755},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45877158641815186},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4545329213142395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4432596266269684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44266897439956665},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43521690368652344},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4186769723892212},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34065890312194824},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3333923816680908},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2632269561290741},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0210027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210027","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:ecommons.cornell.edu:1813/6253","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/6253","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W594694080","https://openalex.org/W1519919954","https://openalex.org/W1655990431","https://openalex.org/W1982129592","https://openalex.org/W1989887898","https://openalex.org/W1999647826","https://openalex.org/W2027466944","https://openalex.org/W2052936500","https://openalex.org/W2073700765","https://openalex.org/W2090186532"],"related_works":["https://openalex.org/W1982464584","https://openalex.org/W4205935260","https://openalex.org/W2066562587","https://openalex.org/W1975910189","https://openalex.org/W1945859206","https://openalex.org/W2030569822","https://openalex.org/W2368684504","https://openalex.org/W2537940722","https://openalex.org/W2526832938","https://openalex.org/W2525308864"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,74],"study":[4],"languages":[5,61,69],"accepted":[6],"by":[7,136],"nondeterministic":[8,38,81,97,120,127],"$\\log":[9,25,34,54,83,99,105,129],"n$-tape":[10,26,35,55,84,100,106,130],"automata":[11,36,64,85,101],"that":[12,30,51,66,76],"scan":[13],"their":[14,20],"input":[15],"only":[16],"once":[17],"and":[18,65,119],"relate":[19],"computational":[21],"power":[22],"to":[23],"two-way":[24,98,104,137],"automata.":[27,141],"We":[28],"show":[29,75],"for":[31,62,80,92,109],"the":[32,37,47,67,93,117,126],"one-way":[33,53,82,128],"model":[39,49],"(1-NL)":[40],"is":[41,89],"computationally":[42,94],"much":[43],"more":[44,95],"powerful":[45,96],"than":[46],"deterministic":[48,118,138],"(1-L),":[50],"under":[52,103],"reductions":[56],"there":[57],"exist":[58],"natural":[59],"complete":[60,68,79,91],"these":[63],"cannot":[70],"be":[71,133],"sparse.":[72],"Furthermore,":[73],"any":[77],"language":[78],"(under":[86],"1-L":[87],"reductions)":[88],"also":[90],"(NL)":[102],"reductions.":[107],"Therefore,":[108],"all":[110],"bounds":[111],"$T(n)$,":[112],"$T(n)":[113],"\\geqq":[114],"\\log":[115],"n$,":[116],"$T(n)$-tape":[121],"bounded":[122],"computations":[123,131],"collapse":[124],"iff":[125],"can":[132],"carried":[134],"out":[135],"log":[139],"n-tape":[140]},"counts_by_year":[{"year":2023,"cited_by_count":7},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}