| Description |
1 online resource (xviii, 237 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 9304 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 9304. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| 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 Abelian-Power-Freeness and Generalizations; Thue-Morse 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 Straight-Line 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; Linear-Time 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 Finite-State 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 Abelian-square Rich Words3.1 The Thue-Morse 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 Burrows-Wheeler Transform; 6 Outlook; References; Prefix-Suffix Square Completion; 1 Introduction; 2 Definitions; 3 Generating Infinite Words; 4 Finite Words: Algorithms; 5 Future Work; References; Square-Density Increasing Mappings; 1 Introduction; 2 Preliminaries; 3 Fractional-Power Density Increasing Mappings to Expand the Alphabet |
| 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 |
| Analysis |
computerwetenschappen |
|
computer sciences |
|
computertechnieken |
|
computer techniques |
|
computational science |
|
wiskunde |
|
mathematics |
|
kunstmatige intelligentie |
|
artificial intelligence |
|
logica |
|
logic |
|
software engineering |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Notes |
International conference proceedings |
|
Includes author index |
|
English |
|
Online resource; title from PDF title page (SpringerLink, viewed September 4, 2015) |
| Subject |
Combinatorial analysis -- Congresses
|
|
Word problems (Mathematics) -- Congresses
|
|
Computer science.
|
|
Discrete mathematics.
|
|
Artificial intelligence.
|
|
Software Engineering.
|
|
Mathematical theory of computation.
|
|
Computers -- Computer Science.
|
|
Computers -- Data Processing.
|
|
Computers -- Intelligence (AI) & Semantics.
|
|
Computers -- Software Development & Engineering -- General.
|
|
Mathematics -- Logic.
|
|
Combinatorial analysis
|
|
Word problems (Mathematics)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Manea, Florin, editor
|
|
Nowotka, Dirk, editor.
|
| ISBN |
9783319236605 |
|
3319236601 |
|
