Del 11682 i serien Lecture Notes in Computer Science

Combinatorics on Words

12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings

Häftad, Engelska, 2019

AvRobert Mercaş,Daniel Reidenbach

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (4)

Häftad

959 kr

Skickas inom 10-15 vardagar

Häftad

1 329 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

This book constitutes the refereed proceedings of the 12th International Conference on Combinatorics on Words, WORDS 2019, held in Loughborough, UK, in September 2019.The 21 revised full papers presented in this book together with 5 invited talks were carefully reviewed and selected from 34 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.

Produktinformation

Utgivningsdatum2019-08-09
Mått155 x 235 x 19 mm
Vikt522 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor327
FörlagSpringer Nature Switzerland AG
ISBN9783030287955

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Matching patterns with variables.- Abelian properties of words.- On sets of words of rank two.- On families of limit S-adic words.- Independent systems of word equations: from Ehrenfeucht to eighteen.- Parikh determinants.- Critical exponent of infinite balanced words via the Pell number system.- Repetitions in infinite palindrome-rich words.- Generalized Lyndon factorizations of infinite words.- On the commutative equivalence of bounded semi-linear codes.- Circularly squarefree words and unbordered conjugates: a new approach.- The undirected repetition threshold.- Characteristic parameters and special trapezoidal words.- Return words and bifix codes in eventually dendric sets.- Enumeration and extensions of word-representable graphs.- Localisation-resistant random words with small alphabets.- On codeword lengths guaranteeing synchronization.- Binary intersection revisited.- On substitutions closed under derivation: examples.- Templates for the k-binomial complexity of the Tribonacci word.- Derived sequences of Arnoux-Rauzy sequences.- New results on pseudosquare avoidance.- Every nonnegative real number is a critical abelian exponent.- Rich words containing two given factors.- Mortality and synchronization of unambiguous finite automata.- On discrete idempotent paths.

Mer från samma författare

Del 13899

Combinatorics on Words

Anna Frid, Robert Mercaş

Häftad, 2023

1 149 kr

Mer från samma serie

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

959 kr

Del 16625

Web Engineering

Andrea Mauri, Lola Burgueño, Riccardo Tommasini

Häftad, 2026

1 099 kr

Du kanske också är intresserad av

Del 13899

Combinatorics on Words

Anna Frid, Robert Mercaş

Häftad, 2023

1 149 kr

Del 15729

Combinatorics on Words

Guilhem Gamard, Julien Leroy

Häftad, 2025

1 329 kr

Del 10432

Combinatorics on Words

Srečko Brlek, Francesco Dolce, Christophe Reutenauer, Élise Vandomme

Häftad, 2017

719 kr

Del 12847

Combinatorics on Words

Thierry Lecroq, Svetlana Puzynina

Häftad, 2021

959 kr

Del 9304

Combinatorics on Words

Florin Manea, Dirk Nowotka

Häftad, 2015

719 kr

Ruth Kvarnström-Jones - Systrarna på Sophiahemmet, Inbunden

Nyhet

Del 3

Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

299 kr329 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

289 kr319 kr

Nyhet

Threshing Day (svensk utgåva)

Rebecca Yarros

Häftad, 2026

299 kr

Nyhet

Threshing Day (Limited Deluxe Edition)

Rebecca Yarros

Inbunden, 2026

339 kr

Sarah J. Maas - A Court of Splintered Harmony, Häftad

Nyhet

Del 6

A Court of Splintered Harmony

Sarah J. Maas

Häftad, 2026

259 kr

Del 11682 i serien Lecture Notes in Computer Science

Combinatorics on Words

12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings

Häftad, Engelska, 2019

AvRobert Mercaş,Daniel Reidenbach

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (4)

Häftad

959 kr

Skickas inom 10-15 vardagar

Häftad

1 329 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2019-08-09
Mått155 x 235 x 19 mm
Vikt522 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor327
FörlagSpringer Nature Switzerland AG
ISBN9783030287955

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Matching patterns with variables.- Abelian properties of words.- On sets of words of rank two.- On families of limit S-adic words.- Independent systems of word equations: from Ehrenfeucht to eighteen.- Parikh determinants.- Critical exponent of infinite balanced words via the Pell number system.- Repetitions in infinite palindrome-rich words.- Generalized Lyndon factorizations of infinite words.- On the commutative equivalence of bounded semi-linear codes.- Circularly squarefree words and unbordered conjugates: a new approach.- The undirected repetition threshold.- Characteristic parameters and special trapezoidal words.- Return words and bifix codes in eventually dendric sets.- Enumeration and extensions of word-representable graphs.- Localisation-resistant random words with small alphabets.- On codeword lengths guaranteeing synchronization.- Binary intersection revisited.- On substitutions closed under derivation: examples.- Templates for the k-binomial complexity of the Tribonacci word.- Derived sequences of Arnoux-Rauzy sequences.- New results on pseudosquare avoidance.- Every nonnegative real number is a critical abelian exponent.- Rich words containing two given factors.- Mortality and synchronization of unambiguous finite automata.- On discrete idempotent paths.