Conference 
WORDS (Conference) (10th : 2015 : Kiel, Germany)

Series 
Lecture notes in computer science, 03029743 ; 9304 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ;
9304.
03029743


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Subject 
Combinatorial analysis  Congresses.


Word problems (Mathematics)  Congresses.

Alt Name 
Manea, Florin,


Nowotka, Dirk,

Add Title 
WORDS 2015 
Description 
1 online resource (xviii, 237 pages) : illustrations. 

polychrome rdacc 
Note 
International conference proceedings. 

Includes author index. 
Summary 
This book constitutes the refereed proceedings of the 10th International Conference on Combinatorics on Words, WORDS 2015, held in Kiel, Germany, in September 2015 under the auspices of the EATCS. The 14 revised full papers presented were carefully reviewed and selected from 22 submissions. The main object in the contributions are words, finite or infinite sequences of symbols over a finite alphabet. The papers reflect both theoretical contributions related to combinatorial, algebraic, and algorithmic aspects of words, as well as to contributions presenting applications of the theory of words in other field of computer science, linguistics, biology, bioinformatics, or physics. 
Note 
English. 
Contents 
Intro; Preface; Organization; Abstracts of Invited Talks; Degrees of Transducibility; Equality Testing of Compressed Strings; On the Contribution of WORDS to the Field of Combinatorics on Words; Codes and Automata in Minimal Sets; Decidability of AbelianPowerFreeness and Generalizations; ThueMorse Along Two Polynomial Subsequences; Contents; Degrees of Transducibility; 1 Introduction; 2 Preliminaries; 2.1 Finite State Transducers and Mealy Machines; 2.2 Degrees of Transducibility; 3 Comparison; 4 Atoms and Polynomials; 5 A Plethora of Questions; References 

Equality Testing of Compressed Strings1 Introduction; 2 StraightLine Programs; 3 Sequential Algorithms; 4 A Parallel Algorithm; 5 Related Problems; 6 Open Problems; References; On the Contribution of WORDS to the Field of Combinatorics on Words; References; Codes and Automata in Minimal Sets; 1 Introduction; 2 Neutral and Tree Sets; 2.1 Neutral Sets; 2.2 Tree Sets; 3 Automata; 4 Codes; 4.1 A Cardinality Theorem for Prefix Codes; 4.2 The Group of a Bifix Code; References; Thue  Morse Along Two Polynomial Subsequences; 1 Introduction; 2 Thue  Morse at Distinct Multiples 

3 Thue  Morse at Two PolynomialsReferences; Canonical Representatives of Morphic Permutations; 1 Introduction; 2 Basic Definitions; 3 Ergodic Permutations; 4 Ergodic Permutations Generated by Words; 4.1 Morphisms on Words and Intervals; References; LinearTime Computation of Prefix Table for Weighted Strings; 1 Introduction; 2 Properties and Auxiliary Data Structures; 3 Algorithm; 4 Final Remarks; References; New Formulas for Dyck Paths in a Rectangle; 1 Introduction; 2 Definitions and Notation; 3 Ferrers Diagrams Comparison Method; 3.1 Diagrams Decomposition Method; 3.2 Technical Results 

4 Theorems5 Examples; 5.1 Example D8,8n+6; 5.2 Example D6,6n+2; 5.3 Example D6,9.; References; Ambiguity of Morphisms in a Free Group; 1 Introduction; 2 Preliminaries; 3 Basic Ambiguity; 4 Unambiguous Injective Morphisms; 4.1 Main Theorem; 4.2 Proof Outline; 5 Patterns with Terminal Symbols; References; The Degree of Squares is an Atom; 1 Introduction; 2 Preliminaries; 3 FiniteState Transducers and Degrees; 4 Characterising Transducts of Spiralling Sequences; 5 Squares; References; Words with the Maximum Number of Abelian Squares; 1 Introduction; 2 Notation and Background 

3 Abeliansquare Rich Words3.1 The ThueMorse Word; 3.2 Sturmian Words; 4 Conclusions and Future Work; References; Arithmetics on Suffix Arrays of Fibonacci Words; 1 Introduction; 2 Related Work; 3 Preliminaries; 4 The Suffix Array and Its Inverse; 5 BurrowsWheeler Transform; 6 Outlook; References; PrefixSuffix Square Completion; 1 Introduction; 2 Definitions; 3 Generating Infinite Words; 4 Finite Words: Algorithms; 5 Future Work; References; SquareDensity Increasing Mappings; 1 Introduction; 2 Preliminaries; 3 FractionalPower Density Increasing Mappings to Expand the Alphabet 
Note 
Online resource; title from PDF title page (SpringerLink, viewed September 4, 2015). 
ISBN 
9783319236605 (electronic bk.) 

3319236601 (electronic bk.) 

9783319236599 

3319236598 
ISBN/ISSN 
10.1007/9783319236605 
OCLC # 
919909128 
Additional Format 
Print version: WORDS (Conference) (10th : 2015 : Kiel, Germany). Combinatorics on words. Cham : Springer, 2015 3319236598 9783319236599 (OCoLC)915120092 
