Mendeley出力
Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / edited by Anna Frid, Robert Mercaş
(Lecture Notes in Computer Science. ISSN:16113349 ; 13899)
| データ種別 | 電子ブック |
|---|---|
| 版 | 1st ed. 2023. |
| 出版者 | (Cham : Springer Nature Switzerland : Imprint: Springer) |
| 出版年 | 2023 |
| 大きさ | X, 301 p. 32 illus., 7 illus. in color : online resource |
| 著者標目 | Frid, Anna editor Mercaş, Robert editor SpringerLink (Online service) |
書誌詳細を非表示
| 一般注記 | Invited Papers: Minimal Complexities for Infinite Words Written with d Letters -- Alternate Base Numeration Systems -- On the number of distinct squares in finite sequences: some old and new results. Contributed Papers: Ranking and Unranking k-Subsequence Universal Words -- Longest common subsequence with gap constraints -- On Substitutions Preserving their Return Sets -- Recurrence and frequencies -- Sturmian and infinitely desubstitutable words accepted by an ω-automaton -- String attractors for factors of the Thue-Morse word -- Critical exponent of Arnoux-Rauzy sequences -- On a class of 2-balanced sequences -- Order conditions for languages -- On Sensitivity of Compact Directed Acyclic Word Graphs -- Smallest and Largest Block Palindrome Factorizations -- String attractors of fixed points of k-bonacci-like morphisms -- Magic Numbers in Periodic Sequences -- Dyck Words, Pattern Avoidance, and Automatic Sequences -- Rudin-Shapiro Sums Via Automata Theory and Logic -- Automaticity and Parikh-collinear morphisms -- On the solution sets of entire systems of word equations -- On arch factorization and subword universality for words and compressed words -- Characteristic sequences of the sets of sums of squares as columns of cellular automata This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023. The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics HTTP:URL=https://doi.org/10.1007/978-3-031-33180-0 |
|---|---|
| 件 名 | LCSH:Machine theory LCSH:Computer networks LCSH:Algorithms LCSH:Natural language processing (Computer science) LCSH:Computer science—Mathematics LCSH:Discrete mathematics FREE:Formal Languages and Automata Theory FREE:Computer Communication Networks FREE:Algorithms FREE:Natural Language Processing (NLP) FREE:Discrete Mathematics in Computer Science |
| 分 類 | LCC:QA267-268.5 DC23:005.131 |
| 書誌ID | EB00002091 |
| ISBN | 9783031331800 |
類似資料
この資料の利用統計
このページへのアクセス回数：2回
※2019年3月27日以降
全貸出数：0回
(1年以内の貸出：0回)
※2019年3月27日以降