{"id":"https://openalex.org/W2240930906","doi":"https://doi.org/10.1142/s0129054116500167","title":"Subset Synchronization and Careful Synchronization of Binary Finite Automata","display_name":"Subset Synchronization and Careful Synchronization of Binary Finite Automata","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2240930906","doi":"https://doi.org/10.1142/s0129054116500167","mag":"2240930906"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054116500167","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500167","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1403.3972","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080979161","display_name":"Vojt\u011bch Vorel","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Vojt\u011bch Vorel","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m. 25, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m. 25, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080979161"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0130628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"05","first_page":"557","last_page":"577"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9966999888420105,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6856269836425781},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5655344724655151},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5633554458618164},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.562221109867096},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.553867757320404},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5490206480026245},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5421799421310425},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5126363635063171},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.497693806886673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48248791694641113},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4665614664554596},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45945316553115845},{"id":"https://openalex.org/keywords/reset","display_name":"Reset (finance)","score":0.4549824595451355},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4438607692718506},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44207918643951416},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.42816194891929626},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.41884177923202515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3838485777378082},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35563787817955017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3172624707221985},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3089783191680908},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1147145926952362},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.09811687469482422}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6856269836425781},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5655344724655151},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5633554458618164},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.562221109867096},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.553867757320404},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5490206480026245},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5421799421310425},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5126363635063171},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.497693806886673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48248791694641113},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4665614664554596},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45945316553115845},{"id":"https://openalex.org/C2779795794","wikidata":"https://www.wikidata.org/wiki/Q7315343","display_name":"Reset (finance)","level":2,"score":0.4549824595451355},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4438607692718506},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44207918643951416},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.42816194891929626},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.41884177923202515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3838485777378082},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35563787817955017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3172624707221985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3089783191680908},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1147145926952362},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.09811687469482422},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054116500167","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500167","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1403.3972","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1403.3972","pdf_url":"https://arxiv.org/pdf/1403.3972","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2240930906","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1403.3972v4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1403.3972","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1403.3972","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1403.3972","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1403.3972","pdf_url":"https://arxiv.org/pdf/1403.3972","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2240930906.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W120468736","https://openalex.org/W145822218","https://openalex.org/W181030226","https://openalex.org/W1484162783","https://openalex.org/W1550462819","https://openalex.org/W1829425890","https://openalex.org/W1848705440","https://openalex.org/W1991980356","https://openalex.org/W1993694495","https://openalex.org/W1997057667","https://openalex.org/W2014108239","https://openalex.org/W2015970678","https://openalex.org/W2037900755","https://openalex.org/W2039529128","https://openalex.org/W2054252811","https://openalex.org/W2102194201","https://openalex.org/W2106446429","https://openalex.org/W2113308301","https://openalex.org/W2122803069","https://openalex.org/W2140195055","https://openalex.org/W2145224012","https://openalex.org/W2171865517","https://openalex.org/W2951907769"],"related_works":["https://openalex.org/W2963458585","https://openalex.org/W2949861521","https://openalex.org/W2952266151","https://openalex.org/W2061027066","https://openalex.org/W3196516880","https://openalex.org/W2963152244","https://openalex.org/W2949863666","https://openalex.org/W3100488283","https://openalex.org/W1498781123","https://openalex.org/W1986184582","https://openalex.org/W2951907769","https://openalex.org/W3080853710","https://openalex.org/W3137885005","https://openalex.org/W1503084978","https://openalex.org/W2885320505","https://openalex.org/W1596878351","https://openalex.org/W2963979500","https://openalex.org/W2963347272","https://openalex.org/W2963853438","https://openalex.org/W2926815817"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,71],"strongly":[3,50,56,90],"exponential":[4,51],"lower":[5],"bound":[6],"that":[7,45,82],"applies":[8],"both":[9,46],"to":[10,20,55,66,77,89,98],"the":[11,21,30,33,36,47,87,99],"subset":[12,72],"synchronization":[13,23],"threshold":[14,24],"for":[15,25],"binary":[16,26,58,92],"deterministic":[17],"automata":[18,111],"and":[19,108,112],"careful":[22],"partial":[27],"automata.":[28,59,93],"In":[29,60],"later":[31],"form,":[32],"result":[34],"finishes":[35],"research":[37],"initiated":[38],"by":[39],"Martyugin":[40],"(2013).":[41],"Moreover,":[42],"we":[43,62,80],"show":[44,81],"thresholds":[48,101],"remain":[49],"even":[52,85],"if":[53],"restricted":[54],"connected":[57,91],"addition,":[61],"apply":[63,96],"our":[64],"methods":[65],"computational":[67],"complexity.":[68],"Existence":[69],"of":[70],"reset":[73],"word":[74],"is":[75],"known":[76],"be":[78],"PSPACE-complete;":[79],"this":[83],"holds":[84],"under":[86],"restriction":[88],"The":[94],"results":[95],"also":[97],"corresponding":[100],"in":[102],"two":[103],"more":[104],"general":[105],"settings:":[106],"D1-":[107],"D3-directable":[109],"nondeterministic":[110],"composition":[113],"sequences":[114],"over":[115],"finite":[116],"domains.":[117]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}