{"id":"https://openalex.org/W4407004764","doi":"https://doi.org/10.46298/lmcs-21(1:11)2025","title":"Random Deterministic Automata With One Added Transition","display_name":"Random Deterministic Automata With One Added Transition","publication_year":2025,"publication_date":"2025-01-30","ids":{"openalex":"https://openalex.org/W4407004764","doi":"https://doi.org/10.46298/lmcs-21(1:11)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(1:11)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:11)2025","pdf_url":"https://lmcs.episciences.org/15166/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15166/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057935060","display_name":"Arnaud Carayol","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arnaud Carayol","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018101364","display_name":"Philippe Duchon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philippe Duchon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074977406","display_name":"Florent Koechlin","orcid":"https://orcid.org/0000-0002-5576-4847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florent Koechlin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042055476","display_name":"Cyril Nicaud","orcid":"https://orcid.org/0000-0002-8770-0119"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cyril Nicaud","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057935060"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02390858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 1","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":0.9994000196456909,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9952999949455261,"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.5705498456954956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4794922471046448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.337989866733551},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3319776654243469},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3001059889793396}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5705498456954956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4794922471046448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.337989866733551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3319776654243469},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3001059889793396}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(1:11)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:11)2025","pdf_url":"https://lmcs.episciences.org/15166/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:1188bd7e35e84e91af8cb7fca7d087e9","is_oa":true,"landing_page_url":"https://doaj.org/article/1188bd7e35e84e91af8cb7fca7d087e9","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 1 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(1:11)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:11)2025","pdf_url":"https://lmcs.episciences.org/15166/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4407004764.pdf","grobid_xml":"https://content.openalex.org/works/W4407004764.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2124122503"],"abstract_inverted_index":{"Every":[0],"language":[1,119],"recognized":[2,10,120],"by":[3,11,121],"a":[4,12,19,49,55,83,97,131,185],"non-deterministic":[5,84],"finite":[6],"automaton":[7,57,116,124,139],"can":[8,32],"be":[9,101,179],"deterministic":[13,56,74],"automaton,":[14],"at":[15,62,173,175],"the":[16,23,29,76,113,118,133],"cost":[17],"of":[18,22,25,117,136,188],"potential":[20],"increase":[21],"number":[24,187],"states,":[26],"which":[27],"in":[28,48,75,191],"worst":[30],"case":[31],"go":[33],"from":[34],"$n$":[35,59],"states":[36,60,190],"to":[37,100,169,178],"$2^n$":[38],"states.":[39],"In":[40,91],"this":[41,45],"article,":[42],"we":[43,53],"investigate":[44],"classical":[46],"result":[47,146],"probabilistic":[50],"setting":[51],"where":[52],"take":[54],"with":[58,110,154,184],"uniformly":[61],"random":[63,68],"and":[64,171],"add":[65],"just":[66],"one":[67,80],"transition.":[69],"These":[70],"automata":[71],"are":[72],"almost":[73],"sense":[77],"that":[78,105,157],"only":[79],"state":[81,95,151],"has":[82,96,125],"choice":[85],"when":[86,149],"reading":[87],"an":[88,123],"input":[89],"letter.":[90],"our":[92],"model,":[93],"each":[94,150],"fixed":[98],"probability":[99,112,156],"final.":[102],"We":[103],"prove":[104],"for":[106],"any":[107,143],"$d\\geq":[108],"1$,":[109],"non-negligible":[111],"minimal":[114,138],"(deterministic)":[115],"such":[122],"more":[126],"than":[127,142],"$n^d$":[128],"states;":[129],"as":[130,161,163],"byproduct,":[132],"expected":[134],"size":[135],"its":[137],"grows":[140],"faster":[141],"polynomial.":[144],"Our":[145],"also":[147],"holds":[148],"is":[152,165],"final":[153,189],"some":[155],"depends":[158],"on":[159],"$n$,":[160],"long":[162],"it":[164],"not":[166],"too":[167],"close":[168],"$0$":[170],"$1$,":[172],"distance":[174],"least":[176],"$\\Omega(\\frac1{\\sqrt{n}})$":[177],"precise,":[180],"therefore":[181],"allowing":[182],"models":[183],"sublinear":[186],"expectation.":[192]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}