{"id":"https://openalex.org/W2798616579","doi":"https://doi.org/10.25596/jalc-2018-189","title":"On the Density of Languages Accepted by Turing Machines and Other Machine Models","display_name":"On the Density of Languages Accepted by Turing Machines and Other Machine Models","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2798616579","doi":"https://doi.org/10.25596/jalc-2018-189","mag":"2798616579"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1903.03018","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.03018","pdf_url":"https://arxiv.org/pdf/1903.03018","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1903.03018","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110211208","display_name":"\u00d3scar H. Ibarra","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ibarra, Oscar H.","raw_affiliation_strings":["University of California Santa Barbara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040385755","display_name":"Ian McQuillan","orcid":"https://orcid.org/0000-0002-7998-4430"},"institutions":[{"id":"https://openalex.org/I32625721","display_name":"University of Saskatchewan","ror":"https://ror.org/010x8gc63","country_code":"CA","type":"education","lineage":["https://openalex.org/I32625721"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"McQuillan, Ian","raw_affiliation_strings":["University of Saskatchewan >  >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Saskatchewan >  >  >  >","institution_ids":["https://openalex.org/I32625721"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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.9990000128746033,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.7709172964096069},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.679925262928009},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6379163265228271},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6049661040306091},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5690368413925171},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.5651290416717529},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5328261256217957},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5026645660400391},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4557587206363678},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45519742369651794},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.4489431381225586},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4470415711402893},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.41936996579170227},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3571264147758484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29715436697006226},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.2971425950527191},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24933871626853943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24709552526474},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19081133604049683},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.16554385423660278},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.0988624095916748},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.09869405627250671}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7709172964096069},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.679925262928009},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6379163265228271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6049661040306091},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5690368413925171},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.5651290416717529},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5328261256217957},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5026645660400391},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4557587206363678},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45519742369651794},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.4489431381225586},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4470415711402893},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.41936996579170227},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3571264147758484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29715436697006226},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.2971425950527191},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24933871626853943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24709552526474},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19081133604049683},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.16554385423660278},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0988624095916748},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.09869405627250671},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:1903.03018","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.03018","pdf_url":"https://arxiv.org/pdf/1903.03018","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},{"id":"doi:10.48550/arxiv.1903.03018","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1903.03018","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.25596/jalc-2018-189","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2018-189","pdf_url":null,"source":null,"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":"pmh:oai:arXiv.org:1903.03018","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.03018","pdf_url":"https://arxiv.org/pdf/1903.03018","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W104936076","https://openalex.org/W196919032","https://openalex.org/W1510695256","https://openalex.org/W1511257926","https://openalex.org/W1584587517","https://openalex.org/W1596202298","https://openalex.org/W1973654289","https://openalex.org/W1982449618","https://openalex.org/W1988472308","https://openalex.org/W1990598022","https://openalex.org/W2023999667","https://openalex.org/W2040136857","https://openalex.org/W2061970672","https://openalex.org/W2076858908","https://openalex.org/W2950107561","https://openalex.org/W2999574320"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W179750864","https://openalex.org/W1511257926","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W2012479020","https://openalex.org/W2522490152","https://openalex.org/W2025957242","https://openalex.org/W55259022"],"abstract_inverted_index":{"A":[0],"language":[1,14,31],"is":[2,15,23,27,60,65,69,99],"dense":[3],"if":[4],"the":[5,13,16,30,111],"set":[6,17],"of":[7,12,18,58],"all":[8,19],"infixes":[9],"(or":[10],"subwords)":[11],"words.":[20],"Here,":[21],"it":[22,26,64,68,98],"shown":[24],"that":[25,67,88],"decidable":[28,71],"whether":[29],"accepted":[32],"by":[33],"a":[34,39,44],"nondeterministic":[35],"Turing":[36,103],"machine":[37],"with":[38,105],"one-way":[40,73,77,82],"read-only":[41],"input":[42],"and":[43,81],"reversal-bounded":[45,74,78,83],"read/write":[46,49],"worktape":[47],"(the":[48],"head":[50],"changes":[51],"direction":[52],"at":[53],"most":[54],"some":[55],"fixed":[56],"number":[57],"times)":[59],"dense.":[61],"From":[62],"this,":[63],"implied":[66],"also":[70],"for":[72,101],"queue":[75],"automata,":[76,80],"stack":[79],"$k$-flip":[84],"pushdown":[85,120],"automata":[86],"(machines":[87],"can":[89],"\"flip\"":[90],"their":[91],"pushdowns":[92],"up":[93],"to":[94,116],"$k$":[95],"times).":[96],"However,":[97],"undecidable":[100],"deterministic":[102],"machines":[104],"two":[106,112],"1-reversal-bounded":[107,119],"worktapes":[108],"(even":[109],"when":[110],"tapes":[113],"are":[114],"restricted":[115],"operate":[117],"as":[118],"stacks).":[121]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2018-05-07T00:00:00"}