{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:30:54Z","timestamp":1729643454642,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,19]]},"DOI":"10.1109\/saci51354.2021.9465549","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T20:24:34Z","timestamp":1625084674000},"page":"000431-000436","source":"Crossref","is-referenced-by-count":0,"title":["Quantity Analysis on the Chaining of Repetition Free Words Considering the VDE Composition Rule"],"prefix":"10.1109","author":[{"given":"Istvan","family":"Finta","sequence":"first","affiliation":[]},{"given":"Lorant","family":"Farkas","sequence":"additional","affiliation":[]},{"given":"Sandor","family":"Szenasi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Symbolic dynamics II: Sturmian sequences","author":"morse","year":"1940","journal-title":"Amer J Math 62"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/1970044"},{"key":"ref14","article-title":"String Attractors and Combinatorics on Words","author":"mantaci","year":"2019","journal-title":"20th Italian Conference on Theoretical Computer Science"},{"key":"ref15","first-page":"996","volume":"28","author":"berstel","year":"2007","journal-title":"The origins of combinatorics on words"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.12700\/APH.15.7.2018.7.5","article-title":"Application of Catalan Numbers and the Lattice Path Combinatorial Problem in Cryptography","volume":"15","author":"sara?evi?","year":"2018","journal-title":"Acta Polytechnica Hungarica"},{"key":"ref17","first-page":"184","article-title":"A Method for Virtual Extension of LZW Compression Dictionary, 19th International ICIN Conference - Innovations in Clouds","author":"finta","year":"2016","journal-title":"Internet2 network"},{"key":"ref18","first-page":"67","author":"finta","year":"2016","journal-title":"Transient analysis of virtual dictionary extension compression method IEEE 17th International Symposium on Computational Intelligence and Informatics (CINTI)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659158"},{"key":"ref4","first-page":"449","article-title":"The enhanced suffix array and its applications to genome analysis. Algorithms in Bioinformatics, Second International Workshop","author":"abouelhoda","year":"2002","journal-title":"WABI"},{"key":"ref3","first-page":"1","author":"keisuke","year":"2017","journal-title":"Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets"},{"key":"ref6","first-page":"1","article-title":"Über unendliche Zeichenreihen","volume":"7","author":"thue","year":"1906","journal-title":"Norske vid Selsk Skr Mat Nat Kl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563"},{"key":"ref8","first-page":"1","article-title":"Über die gegenseitige Loge gleicher Teile gewisser Zeichenreihen","volume":"1","author":"thue","year":"1912","journal-title":"Norske Vid Selsk Skr I Mat Nat Kl Christiana"},{"key":"ref7","article-title":"Die Lösung eines Spezialfalles eines generellen logischen Problems","volume":"8","author":"thue","year":"1910","journal-title":"Norske Vid Selsk Skr I Mat Nat Kl Christiana"},{"key":"ref2","first-page":"707","article-title":"Binary Codes Capable of Correcting Deletions","volume":"10","author":"levenshtein","year":"1966","journal-title":"Insertions and Reversals Soviet Physics Doklady"},{"key":"ref9","article-title":"Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln","volume":"10","author":"thue","year":"1914","journal-title":"Norske Vid Selsk Skr I Mat Nat Kl Christiana"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"}],"event":{"name":"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)","start":{"date-parts":[[2021,5,19]]},"location":"Timisoara, Romania","end":{"date-parts":[[2021,5,21]]}},"container-title":["2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9465482\/9465540\/09465549.pdf?arnumber=9465549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T13:45:01Z","timestamp":1699191901000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9465549\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/saci51354.2021.9465549","relation":{},"subject":[],"published":{"date-parts":[[2021,5,19]]}}}