{"id":"https://openalex.org/W2060520178","doi":"https://doi.org/10.1137/0210009","title":"A Note on the Complexity of General $D0L$ Membership","display_name":"A Note on the Complexity of General $D0L$ Membership","publication_year":1981,"publication_date":"1981-02-01","ids":{"openalex":"https://openalex.org/W2060520178","doi":"https://doi.org/10.1137/0210009","mag":"2060520178"},"language":"en","primary_location":{"id":"doi:10.1137/0210009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210009","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/A5103363705","display_name":"Neil D. Jones","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Neil D. Jones","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017408163","display_name":"Sven Skyum","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sven Skyum","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103363705"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.21430158,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"1","first_page":"114","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9868999719619751,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9868999719619751,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9570000171661377,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.95169997215271,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7714163064956665},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7482665777206421},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7294392585754395},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7172393798828125},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.6190080642700195},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49330034852027893},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48858365416526794},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.4112422466278076},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.26180654764175415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09049540758132935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07519042491912842}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7714163064956665},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7482665777206421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7294392585754395},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7172393798828125},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.6190080642700195},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49330034852027893},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48858365416526794},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.4112422466278076},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.26180654764175415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09049540758132935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07519042491912842},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"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/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0210009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210009","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":5,"referenced_works":["https://openalex.org/W12413374","https://openalex.org/W1602181664","https://openalex.org/W1968427680","https://openalex.org/W1983934395","https://openalex.org/W1989887898"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W2062531583","https://openalex.org/W2898732469","https://openalex.org/W3095925971","https://openalex.org/W1526522828","https://openalex.org/W1555347172","https://openalex.org/W1629505938","https://openalex.org/W2155075753","https://openalex.org/W59272652","https://openalex.org/W2269169662"],"abstract_inverted_index":{"In":[0,23,48],"[Math.":[1],"Systems":[2],"Theory,":[3],"13":[4],"(1979),":[5],"pp.":[6],"29\u201343],":[7],"the":[8,26,36,42,70],"authors":[9],"obtained":[10],"a":[11],"number":[12],"of":[13],"upper":[14,37],"and":[15,41],"lower":[16,43,97],"bounds":[17,27],"for":[18,32,74],"various":[19],"problems":[20],"concerning":[21],"L-systems.":[22],"most":[24],"cases":[25],"were":[28],"rather":[29],"close;":[30],"however,":[31],"general":[33],"$D0L$":[34],"membership":[35,54],"bound":[38,98],"was":[39,44],"$\\mathcal{P}$,":[40],"deterministic":[45],"log":[46,90],"space.":[47,92],"this":[49],"note":[50],"we":[51],"show":[52,78],"that":[53,69,79],"can":[55],"be":[56,110],"decided":[57],"deterministically":[58],"in":[59,88],"$\\log":[60],"^2":[61],"n$":[62],"space,":[63],"which":[64,105],"makes":[65],"it":[66],"very":[67,111],"unlikely":[68],"problem":[71,86],"is":[72,81,94,106],"complete":[73],"$\\mathcal{P}$.":[75],"We":[76],"also":[77,107],"nonmembership":[80],"as":[82,84],"hard":[83],"any":[85],"solvable":[87],"nondeterministic":[89],"n":[91],"This":[93],"an":[95],"improved":[96],"unless":[99],"${\\textbf{DSPACE}}(\\log":[100],"n)":[101],"=":[102],"{\\textbf{NSPACE}}(\\log":[103],"n)$,":[104],"thought":[108],"to":[109],"unlikely.":[112]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}