Combinatorics on words : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings /: 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings. (2015)

• Record Type: Book
• Other Titles: WORDS 2015
• Further Information: Note: Florin Manea, Dirk Nowotka (eds.).
• Editors: Manea, Florin; Nowotka, Dirk
• Other Names: WORDS (Conference), 10th
• 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
• Publisher Details: Cham : Springer
• Publication Date: 2015
• Extent: 1 online resource (xviii, 237 pages), illustrations
• Subjects: 511/.6; Computer science; Combinatorial analysis -- Congresses; Word problems (Mathematics) -- Congresses; Combinatorial analysis; Word problems (Mathematics); Mathematical Theory; Mathematics; Physical Sciences & Mathematics; Computer Science; Mathematical Logic and Formal Languages; Theory of Computation; Discrete Mathematics in Computer Science; Artificial Intelligence (incl. Robotics); Software Engineering; Computers -- Computer Science; Computers -- Data Processing; Computers -- Intelligence (AI) & Semantics; Computers -- Software Development & Engineering -- General; Computer science; Discrete mathematics; Artificial intelligence; Software Engineering; Information theory; Computational complexity; Artificial intelligence; Software engineering; Mathematics -- Logic; Mathematical theory of computation; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319236605; 3319236601
• Related ISBNs: 9783319236599; 3319236598
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed September 4, 2015).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.