Combinatorics on words : 13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021 : proceedings
Author(s)
Bibliographic Information
Combinatorics on words : 13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021 : proceedings
(Lecture notes in computer science, 12847 . LNCS sublibrary ; SL 1 . Theoretical computer science and general issues)
Springer, c2021
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||12847200043175111
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"