{"id":"https://openalex.org/W2164778559","doi":"https://doi.org/10.1142/s0129054191000121","title":"EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES","display_name":"EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES","publication_year":1991,"publication_date":"1991-09-01","ids":{"openalex":"https://openalex.org/W2164778559","doi":"https://doi.org/10.1142/s0129054191000121","mag":"2164778559"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054191000121","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054191000121","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/A5109048685","display_name":"Dung T. Huynh","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dung T. Huynh","raw_affiliation_strings":["Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109048685"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":2.4833,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.9055336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"02","issue":"03","first_page":"183","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.9980000257492065,"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/T12029","display_name":"DNA and Biological Computing","score":0.9980000257492065,"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.8207311630249023},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8126627206802368},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.593684732913971},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5839287638664246},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5669736266136169},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5380818843841553},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.5064791440963745},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4760417938232422},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.43150559067726135},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4118741750717163},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3995528519153595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38446927070617676},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.35797378420829773},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3464909791946411},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.2906911373138428},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.27750110626220703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2290431261062622},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.14238843321800232},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14220210909843445},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.08532729744911194}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8207311630249023},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8126627206802368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.593684732913971},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5839287638664246},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5669736266136169},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5380818843841553},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.5064791440963745},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4760417938232422},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.43150559067726135},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4118741750717163},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3995528519153595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38446927070617676},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35797378420829773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3464909791946411},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.2906911373138428},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.27750110626220703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2290431261062622},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.14238843321800232},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14220210909843445},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.08532729744911194},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054191000121","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054191000121","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":[{"display_name":"Quality Education","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W2089141720","https://openalex.org/W1602383402","https://openalex.org/W1486486721","https://openalex.org/W1511257926","https://openalex.org/W2522490152","https://openalex.org/W1914352394","https://openalex.org/W2023439061","https://openalex.org/W2122981347"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"investigate":[4],"the":[5,9,81],"complexity":[6],"of":[7,23,64,121,130],"computing":[8],"detector,":[10],"constructor":[11,14],"and":[12,69,87,99,128,136],"lexicographic":[13,88,100],"functions":[15],"for":[16,80,92,132],"a":[17],"given":[18],"language.":[19],"The":[20],"following":[21],"classes":[22,82,120,129],"languages":[24,35,44,59,71,122,131],"will":[25],"be":[26],"considered:":[27],"(1)":[28],"context-free":[29],"languages,":[30,57],"(2)":[31],"regular":[32],"sets,":[33],"(3)":[34],"accepted":[36,45,60,72],"by":[37,46,61,73],"one-way":[38,47],"nondeterministic":[39,48],"auxiliary":[40],"pushdown":[41,55],"automata,":[42],"(4)":[43],"logspace-bounded":[49],"Turing":[50],"machines,":[51],"(5)":[52],"two-way":[53],"deterministic":[54],"automaton":[56],"(6)":[58],"uniform":[62],"families":[63],"constant-depth":[65],"polynomial-size":[66],"Boolean":[67],"circuits,":[68],"(7)":[70,94],"multihead":[74],"finite":[75],"automata.":[76],"We":[77],"show":[78],"that":[79],"(1)\u2013(4),":[83],"efficient":[84,125,134],"detectors,":[85,97,126],"constructors":[86,89,98,101,127,137],"exist,":[90],"whereas":[91],"(5)\u2013":[93],"polynomial-time":[95],"computable":[96],"exist":[102],"iff":[103],"there":[104],"are":[105],"no":[106],"sparse":[107],"sets":[108],"in":[109],"NP\u2212P":[110],"(or":[111],"equivalently,":[112],"E=NE).":[113],"Our":[114],"results":[115],"provide":[116],"sharp":[117],"boundaries":[118],"between":[119],"which":[123,133],"have":[124],"detectors":[135],"do":[138],"not":[139],"appear":[140],"to":[141],"exist.":[142]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}