{"id":"https://openalex.org/W2091013922","doi":"https://doi.org/10.1142/s0218196792000050","title":"THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS","display_name":"THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS","publication_year":1992,"publication_date":"1992-03-01","ids":{"openalex":"https://openalex.org/W2091013922","doi":"https://doi.org/10.1142/s0218196792000050","mag":"2091013922"},"language":"en","primary_location":{"id":"doi:10.1142/s0218196792000050","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196792000050","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"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 Algebra and Computation","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":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24746556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"02","issue":"01","first_page":"39","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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.9993000030517578,"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.9516000151634216,"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/T10142","display_name":"Formal Methods in Verification","score":0.9223999977111816,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.820982038974762},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7689468860626221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7369768023490906},{"id":"https://openalex.org/keywords/syntactic-monoid","display_name":"Syntactic monoid","score":0.6607773900032043},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6071585416793823},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5943776965141296},{"id":"https://openalex.org/keywords/free-monoid","display_name":"Free monoid","score":0.5686429738998413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5618346929550171},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5566410422325134},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5189018845558167},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4837656021118164},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.46300652623176575},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.41398027539253235},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3762669563293457},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3487226963043213},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.32509148120880127},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.23119783401489258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21812549233436584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1521073877811432},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11081758141517639}],"concepts":[{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.820982038974762},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7689468860626221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7369768023490906},{"id":"https://openalex.org/C119903167","wikidata":"https://www.wikidata.org/wiki/Q3321297","display_name":"Syntactic monoid","level":4,"score":0.6607773900032043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6071585416793823},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5943776965141296},{"id":"https://openalex.org/C149685015","wikidata":"https://www.wikidata.org/wiki/Q5500266","display_name":"Free monoid","level":3,"score":0.5686429738998413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5618346929550171},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5566410422325134},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5189018845558167},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4837656021118164},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.46300652623176575},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.41398027539253235},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3762669563293457},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3487226963043213},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.32509148120880127},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.23119783401489258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21812549233436584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1521073877811432},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11081758141517639},{"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.1142/s0218196792000050","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196792000050","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"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 Algebra and Computation","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":0,"referenced_works":[],"related_works":["https://openalex.org/W51936586","https://openalex.org/W3143205136","https://openalex.org/W3161268522","https://openalex.org/W2565864224","https://openalex.org/W1975910189","https://openalex.org/W2071633178","https://openalex.org/W2090238248","https://openalex.org/W2537940722","https://openalex.org/W2140195055","https://openalex.org/W2091013922"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,86,123],"complexity":[6],"of":[7,49,125],"deciding":[8],"code":[9,29,98],"and":[10,110,117],"monoid":[11,63,67,72,81],"properties":[12],"for":[13,31,100,122],"regular":[14,32,53,87],"sets":[15,33,88],"specified":[16,34,90],"by":[17,35,56,91],"deterministic":[18,36,58,101],"or":[19,37,64,68],"nondeterministic":[20,38,92,126],"finite":[21,39,59,93,102,127],"automata.":[22,128],"The":[23,28,47,96],"results":[24],"are":[25,73,89],"as":[26],"follows.":[27],"problem":[30,99],"automata":[40,94,103],"is":[41,61,104],"NL-complete":[42,75],"under":[43,76],"NC":[44,77],"(1)":[45,78],"reducibilities.":[46,79],"problems":[48,82],"determining":[50],"whether":[51],"a":[52,57,62,65,69,113],"set":[54],"given":[55],"automaton":[60],"free":[66],"finitely":[70],"generated":[71],"all":[74],"These":[80],"become":[83],"PSPACE-complete":[84],"if":[85],"instead.":[95],"maximal":[97],"shown":[105],"to":[106],"be":[107],"in":[108],"DET":[109],"NL-hard,":[111],"while":[112],"PSPACE":[114],"upper":[115],"bound":[116,120],"NP-hardness":[118],"lower":[119],"hold":[121],"case":[124]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}