Skip to content
VuFind
  • 0 Items in e-Shelf (Full)
  • History
  • User Account
  • Logout
  • User Account
  • Help
    • English
    • Deutsch
  • Books & more
  • Articles & more
  • JuSER
Advanced
 
  • Literature Request
  • Cite this
  • Email this
  • Export
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to MARC
    • Export to MARCXML
    • Export to BibTeX
  • Favorites
  • Add to e-Shelf Remove from e-Shelf
Cover Image
QR Code

Combinatorics on Words [E-Book] : 13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021, Proceedings / edited by Thierry Lecroq, Svetlana Puzynina.

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...

More

Saved in:
Full text
Personal Name(s): Lecroq, Thierry, editor
Puzynina, Svetlana, editor
Edition: 1st edition 2021.
Imprint: Cham : Springer, 2021
Physical Description: XII, 199 pages 22 illustrations (online resource)
Note: englisch
ISBN: 9783030850883
DOI: 10.1007/978-3-030-85088-3
Series Title: Theoretical Computer Science and General Issues ; 12847
Lecture Notes in Computer Science
Subject (LOC):
Algorithms.
Computer communication systems.
Computer science-Mathematics.
Mathematical logic.
Natural language processing (Computer science).
Legal Information on the Use of Electronic Resources


  • Description
  • Table of Contents
  • Staff View

  • 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.

  • Forschungszentrum Jülich
  • Central Library (ZB)
  • Powered by VuFind 6.1.1
Loading...