Atnaujinkite slapukų nuostatas

El. knyga: Combinatorics on Words: 14th International Conference, WORDS 2023, Umea, Sweden, June 12-16, 2023, Proceedings

Edited by , Edited by
  • Formatas: PDF+DRM
  • Serija: Lecture Notes in Computer Science 13899
  • Išleidimo metai: 30-May-2023
  • Leidėjas: Springer International Publishing AG
  • Kalba: eng
  • ISBN-13: 9783031331800
  • Formatas: PDF+DRM
  • Serija: Lecture Notes in Computer Science 13899
  • Išleidimo metai: 30-May-2023
  • Leidėjas: Springer International Publishing AG
  • Kalba: eng
  • ISBN-13: 9783031331800

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 1216, 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
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.