{"id":"https://openalex.org/W4414066643","doi":"https://doi.org/10.1142/s0129054125410096","title":"On the Smallest Synchronizing Terms of Finite Tree Automata","display_name":"On the Smallest Synchronizing Terms of Finite Tree Automata","publication_year":2025,"publication_date":"2025-09-06","ids":{"openalex":"https://openalex.org/W4414066643","doi":"https://doi.org/10.1142/s0129054125410096"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054125410096","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125410096","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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245759","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040350131","display_name":"V\u00e1clav Bla\u017eej","orcid":"https://orcid.org/0000-0001-9165-6280"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"V\u00e1clav Bla\u017eej","raw_affiliation_strings":["University of Warwick, Coventry, CV4 7AL, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-9165-6280","affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, CV4 7AL, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","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, Prague, 160 00, Czechia"],"raw_orcid":"https://orcid.org/0000-0001-9329-1000","affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Th\u00e1kurova 9, Prague, 160 00, 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/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]},{"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":["CZ","SE"],"is_corresponding":false,"raw_author_name":"\u0160t\u011bp\u00e1n Plach\u00fd","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, Campustorget 5, Ume\u00e5, 901 87, Sweden","Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Th\u00e1kurova 9, Prague, 160 00, Czechia"],"raw_orcid":"https://orcid.org/0000-0003-3783-8870","affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, Campustorget 5, Ume\u00e5, 901 87, Sweden","institution_ids":["https://openalex.org/I90267481"]},{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Th\u00e1kurova 9, Prague, 160 00, Czechia","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040350131"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24224347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"01","first_page":"215","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.9987999796867371,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9922999739646912,"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/synchronizing","display_name":"Synchronizing","score":0.6327999830245972},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5835000276565552},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5320000052452087},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.48510000109672546},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.46050000190734863},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4480000138282776},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4059999883174896},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.3986999988555908}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7609000205993652},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.6327999830245972},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5835000276565552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5392000079154968},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5320000052452087},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5310999751091003},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.48510000109672546},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.46050000190734863},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4480000138282776},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4059999883174896},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3986999988555908},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.3813000023365021},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.33410000801086426},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2824999988079071},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.25920000672340393}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054125410096","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125410096","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:wrap.warwick.ac.uk:193962","is_oa":false,"landing_page_url":"https://doi.org/10.1142/S0129054125410096","pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:DiVA.org:umu-245759","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245759","pdf_url":null,"source":{"id":"https://openalex.org/S4306400653","display_name":"Diva portal (Dalarna University Library)","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":"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":"pmh:oai:DiVA.org:umu-245759","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245759","pdf_url":null,"source":{"id":"https://openalex.org/S4306400653","display_name":"Diva portal (Dalarna University Library)","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":"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"},"sustainable_development_goals":[],"awards":[{"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/G4079003659","display_name":"New Horizons in Multivariate Preprocessing (MULTIPROCESS)","funder_award_id":"EP/V044621/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7298990156","display_name":null,"funder_award_id":"2020-03852","funder_id":"https://openalex.org/F4320321033","funder_display_name":"Svenska Forskningsr\u00e5det Formas"}],"funders":[{"id":"https://openalex.org/F4320321033","display_name":"Svenska Forskningsr\u00e5det Formas","ror":"https://ror.org/03pjs1y45"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1975910189","https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W2368684504","https://openalex.org/W2030569822","https://openalex.org/W2269685284","https://openalex.org/W2371400076","https://openalex.org/W1825821945","https://openalex.org/W2525308864","https://openalex.org/W1594958594"],"abstract_inverted_index":{"This":[0,73],"paper":[1],"deals":[2],"with":[3,70,182,199],"properties":[4],"of":[5,16,20,44,46,58,63,79,108,119,138,143,160,170,178,185,202],"synchronizing":[6,61,80,141],"terms":[7,27],"for":[8,95,164],"finite":[9,22],"tree":[10,67],"automata,":[11],"which":[12],"is":[13,39,54,134],"a":[14,30,34,64,90,93,96,123,156],"generalization":[15],"the":[17,37,41,55,59,113,117,135,139,165,176,193],"synchronization":[18,121],"principle":[19],"deterministic":[21,65],"string":[23,142],"automata":[24,171],"(DFA).":[25],"Such":[26],"correspond":[28],"to":[29,49,76],"connected":[31],"subgraph,":[32],"where":[33,130],"state":[35],"in":[36,101,116],"root":[38],"always":[40],"same":[42],"regardless":[43],"states":[45],"subtrees":[47],"attached":[48],"it.":[50,173],"We":[51,110,154],"ask,":[52],"what":[53],"maximum":[56,114,136,189],"height":[57,115,166,177],"smallest":[60],"term":[62],"bottom-up":[66],"automaton":[68],"(DFTA)":[69],"n":[71],"states.":[72],"naturally":[74],"leads":[75],"two":[77,168],"types":[78],"terms,":[81],"called":[82],"weak":[83,120],"and":[84,167,188,192],"strong,":[85],"that":[86,112],"depend":[87],"on":[88],"whether":[89],"variable,":[91],"i.e.,":[92],"placeholder":[94],"subtree,":[97],"must":[98],"be":[99],"present":[100],"at":[102],"least":[103],"one":[104],"leaf":[105],"or":[106],"all":[107],"them.":[109],"prove":[111,151],"case":[118],"has":[122],"theoretical":[124,157],"upper":[125,158],"bound":[126,159],"[Formula:":[127,131,161,179,196],"see":[128,132,162,180,197],"text],":[129],"text]":[133,163,181,198],"length":[137],"shortest":[140],"an":[144,183,200],"n-state":[145],"DFAs.":[146],"For":[147],"strong":[148],"synchronization,":[149],"we":[150],"exponential":[152],"bounds.":[153],"provide":[155],"constructions":[169],"approaching":[172],"One":[174],"achieves":[175,195],"alphabet":[184,201],"linear":[186],"size":[187],"arity":[190],"r,":[191],"other":[194],"quadratic":[203],"size.":[204]},"counts_by_year":[],"updated_date":"2026-02-14T06:23:00.392402","created_date":"2025-10-10T00:00:00"}