{"id":"https://openalex.org/W6891509393","doi":"https://doi.org/10.4230/lipics.cpm.2025.16","title":"Net Occurrences in Fibonacci and Thue-Morse Words","display_name":"Net Occurrences in Fibonacci and Thue-Morse Words","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6891509393","doi":"https://doi.org/10.4230/lipics.cpm.2025.16"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23110","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.16/LIPIcs.CPM.2025.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.16/LIPIcs.CPM.2025.16.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Guo, Peaker","orcid":"https://orcid.org/0000-0002-9098-1783"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Guo, Peaker","raw_affiliation_strings":["School of Computing and Information Systems, The University of Melbourne, Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0002-9098-1783","affiliations":[{"raw_affiliation_string":"School of Computing and Information Systems, The University of Melbourne, Parkville, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":null,"display_name":"Kishi, Kaisei","orcid":null},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kishi, Kaisei","raw_affiliation_strings":["Department of Information Science and Technology, Kyushu University, Fukuoka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Science and Technology, Kyushu University, Fukuoka, Japan","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1999077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.4465000033378601,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.4465000033378601,"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/T11567","display_name":"semigroups and automata theory","score":0.3962000012397766,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.05559999868273735,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8884999752044678},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.789900004863739},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.7059999704360962},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5748999714851379},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5508999824523926},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4973999857902527}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8884999752044678},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.789900004863739},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.7059999704360962},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5748999714851379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5539000034332275},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5508999824523926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5342000126838684},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4973999857902527},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.48080000281333923},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42149999737739563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4108999967575073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4075999855995178},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2827000021934509},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2768000066280365}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23110","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.16/LIPIcs.CPM.2025.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.cpm.2025.16","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2025.16","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23110","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.16/LIPIcs.CPM.2025.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6891509393.pdf","grobid_xml":"https://content.openalex.org/works/W6891509393.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"net":[1,21,31,44,97,119,154,182,194,206,214],"occurrence":[2,12,207],"of":[3,23,29,101,106,118,134,153,204,225,227,232,252],"a":[4,8,126,222],"repeated":[5],"string":[6,25],"in":[7,33,40,69,99,121,142,216,246],"text":[9],"is":[10,26],"an":[11],"with":[13],"unique":[14,104],"left":[15],"and":[16,19,59,82,84,93,145,229,243,249],"right":[17],"extensions,":[18],"the":[20,24,27,34,70,89,102,107,116,130,150,173,202,212],"frequency":[22,45],"number":[28],"its":[30,51,67],"occurrences":[32,98,120,155,215,226],"text.":[35,108,218],"Originally":[36],"introduced":[37],"for":[38,50],"applications":[39,245],"Natural":[41],"Language":[42],"Processing,":[43],"has":[46,138],"recently":[47],"gained":[48],"attention":[49],"algorithmic":[52,143],"aspects.":[53],"Guo":[54,74,110],"et":[55,61,75,111],"al.":[56,62,76,112],"[CPM":[57,86,113],"2024]":[58,64,114],"Ohlebusch":[60],"[SPIRE":[63,77],"focus":[65],"on":[66,129],"computation":[68],"offline":[71],"setting,":[72],"while":[73],"2024],":[78,81],"Inenaga":[79,85,94],"[arXiv":[80],"Mieno":[83,92],"2025]":[87],"tackle":[88],"online":[90],"counterpart.":[91],"also":[95],"characterize":[96],"terms":[100],"minimal":[103],"substrings":[105],"Additionally,":[109],"initiate":[115],"study":[117],"Fibonacci":[122,177,228],"words":[123,231],"to":[124,158],"establish":[125],"lower":[127],"bound":[128],"asymptotic":[131],"running":[132],"time":[133],"algorithms.":[135],"Although":[136],"there":[137],"been":[139],"notable":[140],"progress":[141],"developments":[144],"some":[146],"initial":[147],"combinatorial":[148,151,250],"insights,":[149],"aspects":[152],"have":[156,240],"yet":[157],"be":[159],"thoroughly":[160],"examined.":[161],"In":[162],"this":[163],"work,":[164],"we":[165,171,185,200,220],"make":[166],"two":[167],"key":[168],"contributions.":[169],"First,":[170],"confirm":[172],"conjecture":[174],"that":[175,187,238],"each":[176,188],"word":[178,190],"contains":[179,191],"exactly":[180,192],"three":[181],"occurrences.":[183,195],"Second,":[184],"show":[186],"Thue-Morse":[189,230],"nine":[193],"To":[196],"achieve":[197],"these":[198,253],"results,":[199],"introduce":[201],"notion":[203],"overlapping":[205],"cover,":[208],"which":[209],"narrows":[210],"down":[211],"candidate":[213],"any":[217],"Furthermore,":[219],"provide":[221],"precise":[223],"characterization":[224],"smaller":[233],"order,":[234],"offering":[235],"structural":[236],"insights":[237],"may":[239],"independent":[241],"interest":[242],"potential":[244],"algorithm":[247],"analysis":[248],"properties":[251],"words.":[254]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}