{"id":"https://openalex.org/W4234189135","doi":"https://doi.org/10.1142/s0129054114400280","title":"SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS","display_name":"SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W4234189135","doi":"https://doi.org/10.1142/s0129054114400280"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400280","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400280","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/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":true,"raw_author_name":"OSCAR H. IBARRA","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065615032","display_name":"Bala Ravikumar","orcid":null},"institutions":[{"id":"https://openalex.org/I158011677","display_name":"Sonoma State University","ror":"https://ror.org/04wjxkk25","country_code":"US","type":"education","lineage":["https://openalex.org/I158011677"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BALA RAVIKUMAR","raw_affiliation_strings":["Department of Computer and Engineering Science, Sonoma State University, Rohnert Park, CA 94928, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Engineering Science, Sonoma State University, Rohnert Park, CA 94928, USA","institution_ids":["https://openalex.org/I158011677"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110211208"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6855868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":"08","first_page":"1127","last_page":"1140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.996399998664856,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9961000084877014,"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/undecidable-problem","display_name":"Undecidable problem","score":0.9888604879379272},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.950610876083374},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.7263274192810059},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6927400231361389},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6072931885719299},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5850187540054321},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5794168710708618},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5736837387084961},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5718789100646973},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.567908763885498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5022337436676025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4204573631286621},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4108809530735016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3689734935760498},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24053984880447388},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1400023102760315}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.9888604879379272},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.950610876083374},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.7263274192810059},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6927400231361389},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6072931885719299},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5850187540054321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5794168710708618},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5736837387084961},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5718789100646973},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.567908763885498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5022337436676025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4204573631286621},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4108809530735016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3689734935760498},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24053984880447388},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1400023102760315},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054114400280","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400280","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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":14,"referenced_works":["https://openalex.org/W1979876920","https://openalex.org/W1982449618","https://openalex.org/W1988472308","https://openalex.org/W2010117085","https://openalex.org/W2011523226","https://openalex.org/W2023999667","https://openalex.org/W2025256949","https://openalex.org/W2049481601","https://openalex.org/W2061168833","https://openalex.org/W2061970672","https://openalex.org/W2076858908","https://openalex.org/W2111270089","https://openalex.org/W2165854715","https://openalex.org/W2170953202"],"related_works":["https://openalex.org/W4234189135","https://openalex.org/W2489809986","https://openalex.org/W3022248317","https://openalex.org/W2585890227","https://openalex.org/W3144220040","https://openalex.org/W1693995122","https://openalex.org/W1543051890","https://openalex.org/W1594629328","https://openalex.org/W2170336571","https://openalex.org/W2618109676"],"abstract_inverted_index":{"Almost":[0],"all":[1],"the":[2,6,20,25,28,36,68,85,97,102],"decision":[3],"questions":[4],"concerning":[5],"resource":[7],"requirements":[8],"of":[9,31,39,87],"a":[10],"computational":[11],"device":[12],"are":[13],"undecidable.":[14],"Here":[15],"we":[16,90],"want":[17],"to":[18,93,100],"understand":[19],"exact":[21],"boundary":[22],"that":[23,43],"separates":[24],"undecidable":[26],"from":[27],"decidable":[29,88],"cases":[30],"such":[32],"problems":[33],"by":[34],"considering":[35],"time":[37],"complexity":[38,98],"very":[40],"simple":[41],"devices":[42],"include":[44],"NFAs":[45],"(1-way":[46],"and":[47,50,56,76],"2-way),":[48],"PDAs":[49,51],"augmented":[52],"with":[53],"counters":[54],"-":[55,64],"their":[57],"unambiguous":[58],"restrictions.":[59],"We":[60],"consider":[61],"several":[62],"variations":[63],"based":[65],"on":[66],"whether":[67],"bound":[69],"holds":[70],"exactly":[71],"or":[72],"as":[73,79,81],"an":[74],"upper-bound":[75],"show":[77],"decidability":[78],"well":[80],"undecidability":[82],"results.":[83],"In":[84],"case":[86],"problems,":[89],"also":[91],"attempt":[92],"determine":[94],"more":[95],"precisely":[96],"class":[99],"which":[101],"problem":[103],"belongs.":[104]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
