{"id":"https://openalex.org/W2977641217","doi":"https://doi.org/10.25596/jalc-2019-321","title":"Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words","display_name":"Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2977641217","doi":"https://doi.org/10.25596/jalc-2019-321","mag":"2977641217"},"language":"en","primary_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:213448","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/213448","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata, Languages and Combinatorics, (2019)","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/213448","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030983122","display_name":"Fran\u00e7ois Gonze","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gonze, Fran\u00e7ois","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056625594","display_name":"Rapha\u00ebl M. Jungers","orcid":"https://orcid.org/0000-0002-7789-0940"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jungers, Rapha\u00ebl M.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7106,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7391183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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.9986000061035156,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9973000288009644,"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/automaton","display_name":"Automaton","score":0.6032413244247437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.536878228187561},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3981305956840515},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37746021151542664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37697046995162964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36566483974456787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3411598801612854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3298089802265167}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6032413244247437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.536878228187561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3981305956840515},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37746021151542664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37697046995162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36566483974456787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3411598801612854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3298089802265167}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:dial.uclouvain.be:boreal:213448","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/213448","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata, Languages and Combinatorics, (2019)","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.25596/jalc-2019-321","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2019-321","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":null,"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:213448","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/213448","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata, Languages and Combinatorics, (2019)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1991980356","https://openalex.org/W2265316437","https://openalex.org/W2407909453","https://openalex.org/W2468044850","https://openalex.org/W2801818712","https://openalex.org/W2804396909","https://openalex.org/W3102519952"],"related_works":["https://openalex.org/W2951456996","https://openalex.org/W3110029581","https://openalex.org/W2468044850","https://openalex.org/W179692292","https://openalex.org/W2022386943","https://openalex.org/W3147836413","https://openalex.org/W2061771611","https://openalex.org/W1490034329","https://openalex.org/W1615228264","https://openalex.org/W2278693202","https://openalex.org/W2573882791"],"abstract_inverted_index":{"This":[0],"article":[1],"focuses":[2],"on":[3,98],"subset":[4],"reachability":[5],"in":[6,21],"synchronizing":[7,22],"automata.":[8,23,77,135],"First,":[9],"we":[10,56,101,111,137],"study":[11],"the":[12,58,80,108,120,127],"length":[13],"of":[14,19,45,52,82,84,123,129,132,142],"shortest":[15],"words":[16,36,67,131],"reaching":[17],"subsets":[18,30],"states":[20],"We":[24,47,78],"provide":[25,102],"an":[26,139],"automata":[27],"family":[28],"with":[29],"that":[31],"cannot":[32],"be":[33],"reached":[34],"by":[35,115],"shorter":[37],"than":[38],"$2^n/n$,":[39],"thus":[40],"disproving":[41],"a":[42,70,103,113],"recent":[43],"conjecture":[44,114],"Don.":[46],"then":[48],"analyze":[49,57],"relaxed":[50],"versions":[51],"this":[53,124,143],"conjecture.":[54,144],"Second,":[55],"$\\Gamma_1$-graph":[59,62],"construction.":[60],"The":[61],"is":[63,69],"derived":[64],"from":[65],"1-deficient":[66,85,130],"and":[68,117,126],"key":[71],"tool":[72],"for":[73,94,106],"studying":[74],"completely":[75,133],"reachable":[76,134],"introduce":[79],"concept":[81],"roots":[83],"words,":[86],"which":[87],"allows":[88],"to":[89],"state":[90],"explicit":[91],"concatenation":[92,128],"rules":[93],"these":[95,99],"words.":[96],"Based":[97],"results,":[100],"polynomial-time":[104],"algorithm":[105],"constructing":[107],"$\\Gamma_1$-graph.":[109],"Then,":[110],"disprove":[112],"Bondar":[116],"Volkov":[118],"linking":[119],"strong":[121],"connectivity":[122],"graph":[125],"Finally,":[136],"prove":[138],"alternative":[140],"version":[141]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}