{"id":"https://openalex.org/W128312770","doi":"https://doi.org/10.1007/978-3-322-95233-2_14","title":"Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages","display_name":"Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W128312770","doi":"https://doi.org/10.1007/978-3-322-95233-2_14","mag":"128312770"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-322-95233-2_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-322-95233-2_14","pdf_url":null,"source":{"id":"https://openalex.org/S4210233246","display_name":"Teubner-Texte zur Informatik","issn_l":"1615-4584","issn":["1615-4584"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEUBNER-TEXTE zur Informatik","raw_type":"book-chapter"},"type":"book-chapter","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, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Program, University of Texas at Dallas, Richardson, 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":0.6782,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67251462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.998199999332428,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9886999726295471,"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.7184591889381409},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.660142183303833},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5919296741485596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5539016723632812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5169314742088318},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5080842971801758},{"id":"https://openalex.org/keywords/closeness","display_name":"Closeness","score":0.4784000813961029},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4726865589618683},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.46599045395851135},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.44102874398231506},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4303610324859619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3617698550224304},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.35243725776672363},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3432565927505493},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.28443643450737},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.2759906053543091},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.2671414613723755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21816080808639526},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1450669765472412}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7184591889381409},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.660142183303833},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5919296741485596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5539016723632812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5169314742088318},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5080842971801758},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.4784000813961029},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4726865589618683},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.46599045395851135},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.44102874398231506},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4303610324859619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3617698550224304},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.35243725776672363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3432565927505493},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.28443643450737},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.2759906053543091},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.2671414613723755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21816080808639526},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1450669765472412},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-322-95233-2_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-322-95233-2_14","pdf_url":null,"source":{"id":"https://openalex.org/S4210233246","display_name":"Teubner-Texte zur Informatik","issn_l":"1615-4584","issn":["1615-4584"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEUBNER-TEXTE zur Informatik","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W299519334","https://openalex.org/W421997344","https://openalex.org/W1535681052","https://openalex.org/W1598450631","https://openalex.org/W1971691873","https://openalex.org/W1973657331","https://openalex.org/W1980967952","https://openalex.org/W1982206794","https://openalex.org/W1986448430","https://openalex.org/W1988572171","https://openalex.org/W1992643817","https://openalex.org/W1998084650","https://openalex.org/W2007431032","https://openalex.org/W2007464118","https://openalex.org/W2017205387","https://openalex.org/W2021009590","https://openalex.org/W2022772583","https://openalex.org/W2042259773","https://openalex.org/W2043360684","https://openalex.org/W2119397055","https://openalex.org/W2148224873","https://openalex.org/W2188913344","https://openalex.org/W4255503374"],"related_works":["https://openalex.org/W2030569822","https://openalex.org/W2136740376","https://openalex.org/W2050777932","https://openalex.org/W1987608226","https://openalex.org/W2079577017","https://openalex.org/W2111868903","https://openalex.org/W2037872771","https://openalex.org/W2772918710","https://openalex.org/W4308880995","https://openalex.org/W61785131"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"investigate":[4],"the":[5,24,68,94,118],"complexity":[6],"of":[7],"deciding":[8],"closeness,":[9],"segment":[10,50,69],"equivalence":[11,51,70,95,119],"and":[12,16,42,55,74,78,86,99,109],"sparseness":[13,82],"for":[14,27,37,44,53,62,72,84,97],"context-free":[15,28],"regular":[17],"languages.":[18],"It":[19,59],"will":[20],"be":[21],"shown":[22],"that":[23,93],"closeness":[25],"problem":[26,120],"grammars":[29],"(CFGs)":[30],"is":[31,35,60,121],"undecidable":[32],"while":[33],"it":[34],"PSPACE-complete":[36],"nondeterministic":[38],"finite":[39,46],"automata":[40,47],"(NFAs)":[41],"NL-complete":[43,61],"deterministic":[45],"(DFAs).":[48],"The":[49,81],"problems":[52,71,83,96],"CFGs":[54,73,98],"NFAs":[56,75,85,100],"are":[57,76,88,104],"co-NP-complete.":[58],"DFAs.":[63],"If":[64],"encoded":[65],"in":[66,122],"binary,":[67],"co-NE-complete":[77],"PSPACE-complete,":[79],"respectively.":[80,111],"DFAs":[87,114],"NL-complete.":[89],"We":[90],"also":[91],"show":[92],"generating":[101,115],"commutative":[102,116],"languages":[103,117],"II":[105],"2":[106],"P":[107],"-complete":[108],"co-NP-complete,":[110],"For":[112],"trim":[113],"L.":[123]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}