{"id":"https://openalex.org/W2742298217","doi":"https://doi.org/10.3233/fi-2017-1560","title":"State Complexity of k-Parallel Tree Concatenation","display_name":"State Complexity of k-Parallel Tree Concatenation","publication_year":2017,"publication_date":"2017-08-09","ids":{"openalex":"https://openalex.org/W2742298217","doi":"https://doi.org/10.3233/fi-2017-1560","mag":"2742298217"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2017-1560","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1560","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077698683","display_name":"Yo-Sub Han","orcid":"https://orcid.org/0000-0002-7211-6657"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yo-Sub Han","raw_affiliation_strings":["Department of Computer Science, Yonsei University, 50 Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea. emmous@yonsei.ac.kr"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yonsei University, 50 Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea. emmous@yonsei.ac.kr","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011019318","display_name":"Sang\u2010Ki Ko","orcid":"https://orcid.org/0000-0002-5406-5104"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sang-Ki Ko","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Ashton Street, Liverpool, L69 3BX, United Kingdom. sangkiko@liverpool.ac.uk"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Ashton Street, Liverpool, L69 3BX, United Kingdom. sangkiko@liverpool.ac.uk","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009151151","display_name":"Kai Salomaa","orcid":"https://orcid.org/0000-0003-4582-7477"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kai Salomaa","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada. ksalomaa@cs.queensu.ca"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada. ksalomaa@cs.queensu.ca","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077698683"],"corresponding_institution_ids":["https://openalex.org/I193775966"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13456096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"154","issue":"1-4","first_page":"185","last_page":"199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9997000098228455,"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.9890000224113464,"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/T10142","display_name":"Formal Methods in Verification","score":0.9842000007629395,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.8059308528900146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6616425514221191},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6507052779197693},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6308308243751526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6128969788551331},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5253999829292297},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4867517948150635},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.47056150436401367},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4495474398136139},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4474501609802246},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4445454776287079},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4189671277999878},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.25240349769592285},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.249356210231781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24361097812652588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1811569631099701},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15279963612556458}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.8059308528900146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6616425514221191},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6507052779197693},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6308308243751526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6128969788551331},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5253999829292297},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4867517948150635},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.47056150436401367},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4495474398136139},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4474501609802246},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4445454776287079},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4189671277999878},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.25240349769592285},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.249356210231781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24361097812652588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1811569631099701},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15279963612556458},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2017-1560","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1560","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5349794229","display_name":null,"funder_award_id":"EP/M00077X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"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/W1972592804","https://openalex.org/W252108735","https://openalex.org/W2510632068","https://openalex.org/W2063737596","https://openalex.org/W1607287758","https://openalex.org/W2240836793","https://openalex.org/W2061007349","https://openalex.org/W2620973848","https://openalex.org/W3121898969","https://openalex.org/W1985499786"],"abstract_inverted_index":{"We":[0,47,59,72],"give":[1,48],"an":[2,34],"optimized":[3],"construction":[4,32],"of":[5,17,42,70,80,87,105],"a":[6,49,96],"tree":[7,15,20,23,44,82],"automaton":[8],"recognizing":[9],"the":[10,31,39,54,62,75,81,85],"k-parallel,":[11],"k":[12,56],"\u2265":[13],"1,":[14],"concatenation":[16],"two":[18],"regular":[19],"languages.":[21],"For":[22],"automata":[24],"with":[25],"m":[26],"and":[27,91],"n":[28],"states,":[29],"respectively,":[30],"yields":[33],"upper":[35,63],"bound":[36,52,64,101],"(m+12)(n+1)\u22c52nk\u22121":[37],"for":[38,67,102],"state":[40,99],"complexity":[41,100],"k-parallel":[43],"concat":[45],"enation.":[46],"matching":[50],"lower":[51],"in":[53,92],"case":[55,77,94],"=":[57],"2.":[58],"conjecture":[60],"that":[61],"is":[65,84],"tight":[66,98],"all":[68,88,103],"values":[69,104],"k.":[71,106],"also":[73],"consider":[74],"special":[76],"where":[78],"one":[79],"languages":[83],"set":[86],"ranked":[89],"trees":[90],"this":[93],"establish":[95],"different":[97]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}