Muutke küpsiste eelistusi

E-raamat: Combinatorics on Words: 14th International Conference, WORDS 2023, Umea, Sweden, June 12-16, 2023, Proceedings

Edited by , Edited by
  • Formaat - EPUB+DRM
  • Hind: 80,26 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.