{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[18,2,18,3],[19,2,19,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910502647703321"]
[null,null,"Titolo",null,"Combinatorics on Words : 13th International Conference, WORDS 2021, Rouen, France, September 13–17, 2021, Proceedings / / edited by Thierry Lecroq, Svetlana Puzynina"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021"]
[null,null,"ISBN",null,"3-030-85088-9"]
[null,null,"Edizione",null,"[1st ed. 2021.]"]
[null,null,"Descrizione fisica",null,"1 online resource (210 pages)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12847"]
[null,null,"Disciplina",null,"511.6"]
[null,null,"Soggetti",null,"Machine theory"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Synchronized Sequences -- Continuants with equal values, a combinatorial approach -- Quaternary n-cubes and Isometric Words -- Strings from linear recurrences: a Gray code -- String Theories involving Regular Membership Predicates: From Practice to Theory and Back -- Binary cyclotomic polynomials: representation via words and algorithms -- Computation of critical exponent in balanced sequences -- The Range Automaton: An Efficient Approach to Text-Searching -- A numeration system for Fibonacci-like Wang shifts -- Perfectly clustering words are primitive positive elements of the free group -- On Billaud Words and Their Companions -- Counting ternary square-free words quickly -- Doubled patterns with reversal are 3-avoidable -- A characterization of binary morphisms generating Lyndon in finite words -- Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order -- Equations over the k-binomial monoids."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc."]