{"id":"https://openalex.org/W4414099135","doi":"https://doi.org/10.1007/s00236-025-00484-0","title":"Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching","display_name":"Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414099135","doi":"https://doi.org/10.1007/s00236-025-00484-0"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-025-00484-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-025-00484-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00484-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00484-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006012839","display_name":"Jan Janou\u0161ek","orcid":"https://orcid.org/0000-0001-9329-1000"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Janou\u0161ek","raw_affiliation_strings":["Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Th\u00e1kurova 9, 16000, Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Th\u00e1kurova 9, 16000, Prague, Czechia","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074761376","display_name":"\u0160t\u011bp\u00e1n Plach\u00fd","orcid":"https://orcid.org/0000-0003-3783-8870"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"\u0160t\u011bp\u00e1n Plach\u00fd","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, Universitetstorget 4, 901 87, Ume\u00e5, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, Universitetstorget 4, 901 87, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074761376"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22807329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"62","issue":"3","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.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/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9994000196456909,"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/deterministic-automaton","display_name":"Deterministic automaton","score":0.7336000204086304},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.661300003528595},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5615000128746033},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4959000051021576},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.49050000309944153},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47350001335144043},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.4465000033378601},{"id":"https://openalex.org/keywords/continuous-automaton","display_name":"Continuous automaton","score":0.41260001063346863},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4004000127315521}],"concepts":[{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.7336000204086304},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.661300003528595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5985999703407288},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5615000128746033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5325000286102295},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4959000051021576},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.49050000309944153},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46000000834465027},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4465000033378601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4359999895095825},{"id":"https://openalex.org/C21720249","wikidata":"https://www.wikidata.org/wiki/Q5165460","display_name":"Continuous automaton","level":5,"score":0.41260001063346863},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4004000127315521},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.3837999999523163},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3192000091075897},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.31220000982284546},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.2971999943256378},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.2928999960422516},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2824999988079071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.271699994802475},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.26269999146461487},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2597000002861023}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00236-025-00484-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-025-00484-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00484-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:umu-245641","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245641","pdf_url":"https://umu.diva-portal.org/smash/get/diva2:2006841/FULLTEXT01","source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"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":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/s00236-025-00484-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-025-00484-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00484-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1299318184","display_name":null,"funder_award_id":"SGS20/208/OHK3/3T/18","funder_id":"https://openalex.org/F4320309972","funder_display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze"},{"id":"https://openalex.org/G2179154197","display_name":null,"funder_award_id":"2020-03852","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G2291329386","display_name":null,"funder_award_id":"CZ.02.1.01/0.0/0.0/16_019/0000765","funder_id":"https://openalex.org/F4320334253","funder_display_name":"Research Center for Informatics, Czech Technical University in Prague"},{"id":"https://openalex.org/G2759202153","display_name":null,"funder_award_id":"CZ.02.1.01/0.0/0.0/16_019/0000765","funder_id":"https://openalex.org/F4320309972","funder_display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze"},{"id":"https://openalex.org/G8470341104","display_name":null,"funder_award_id":"CZ.02.1.01/0.0/0.0/16_019/","funder_id":"https://openalex.org/F4320334253","funder_display_name":"Research Center for Informatics, Czech Technical University in Prague"}],"funders":[{"id":"https://openalex.org/F4320309972","display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze","ror":"https://ror.org/03kqpb082"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320334253","display_name":"Research Center for Informatics, Czech Technical University in Prague","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414099135.pdf","grobid_xml":"https://content.openalex.org/works/W4414099135.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W156540454","https://openalex.org/W1491471557","https://openalex.org/W1577337656","https://openalex.org/W1964088589","https://openalex.org/W2010571644","https://openalex.org/W2039424493","https://openalex.org/W2067216917","https://openalex.org/W2118296037","https://openalex.org/W2137012751","https://openalex.org/W2138373802","https://openalex.org/W2741273024","https://openalex.org/W2980236460","https://openalex.org/W2999143991","https://openalex.org/W3200493159","https://openalex.org/W4214868841","https://openalex.org/W4301139523","https://openalex.org/W4385701136","https://openalex.org/W4392605830"],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2003664089","https://openalex.org/W1983100634","https://openalex.org/W185868636","https://openalex.org/W1990283467","https://openalex.org/W63685668","https://openalex.org/W2026879508","https://openalex.org/W2136740376","https://openalex.org/W3087272834","https://openalex.org/W2111868903"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,10,140,151,156,171,221],"deterministic":[3,15,157],"finite":[4,16,158],"automaton":[5,47,61,66,145,169,223],"(DFA)":[6],"A,":[7],"we":[8,129,175],"present":[9,176],"simple":[11],"algorithm":[12,178],"for":[13,103,123,139,146,179],"constructing":[14],"automata":[17,90],"that":[18,131,206],"accept":[19,95],"the":[20,24,28,32,36,41,46,55,60,64,71,79,104,110,121,168,181,186,207,213,216],"shortest":[21,25,29,33,37,42,56,83,195,200],"forbidden":[22,26,30,34,107,196,201],"factors,":[23,108,117],"prefixes,":[27],"suffixes,":[31,39,204],"words,":[35],"allowed":[38,43,203],"and":[40,69,88,118,198],"words":[44],"of":[45,59,81,106,112,115,126,134,143,155,185,193,215,220],"A.":[48,62],"We":[49,149,211],"refer":[50],"to":[51],"these":[52,89],"sets":[53,80,208],"as":[54],"characteristic":[57,84,116],"factors":[58,85,197],"If":[63],"given":[65],"is":[67,75],"local,":[68],"therefore":[70],"language":[72],"it":[73],"accepts":[74],"strictly":[76],"locally":[77],"testable,":[78],"its":[82,194,199],"are":[86,91,209],"finite,":[87],"acyclic.":[92],"Otherwise,":[93],"they":[94],"infinite":[96],"languages.":[97],"This":[98],"approach":[99],"simplifies":[100],"existing":[101],"methods":[102],"extraction":[105,111,122,135],"allows":[109],"more":[113],"types":[114],"also":[119],"generalizes":[120],"all":[124,161],"classes":[125],"DFAs.":[127],"Furthermore,":[128],"demonstrate":[130],"this":[132],"type":[133],"can":[136,230],"be":[137],"used":[138],"sublinear":[141,232],"run":[142,154,184,219],"an":[144,164,177],"certain":[147],"inputs.":[148],"define":[150],"positive":[152,182,217],"position":[153,183,218],"automaton,":[159,187],"representing":[160],"positions":[162],"in":[163],"input":[165],"string":[166],"where":[167],"reaches":[170],"final":[172],"state.":[173],"Finally,":[174],"computing":[180],"which":[188,229],"utilizes":[189],"pattern":[190,226],"set":[191,227],"matching":[192],"or":[202],"provided":[205],"finite.":[210],"showcase":[212],"computation":[214],"local":[222],"using":[224],"backward":[225],"matching,":[228],"achieve":[231],"time.":[233]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}