ABSTRACT

The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnology, data communication, and DNA computing. Delving

part |2 pages

Dedication

chapter |4 pages

Contents

part |2 pages

List of Tables

chapter |4 pages

List of Figures

chapter |10 pages

Preface

part 1|2 pages

Part I: BASICS

chapter 1|18 pages

Preliminaries on Partial Words

chapter 2|18 pages

Combinatorial Properties of Partial Words

part 2|2 pages

Part II: PERIODICITY

chapter 3|30 pages

Fine and Wilf’s Theorem

chapter 4|24 pages

Critical Factorization Theorem

chapter 5|38 pages

Guibas and Odlyzko’s Theorem

part 3|2 pages

Part III: PRIMITIVITY

chapter 6|42 pages

Primitive Partial Words

chapter 7|24 pages

Unbordered Partial Words

part 4|2 pages

Part IV: CODING

chapter 8|32 pages

Pcodes of Partial Words

chapter 9|22 pages

Deciding the Pcode Property

part |2 pages

Part V: FURTHER TOPICS

chapter 10|16 pages

Equations on Partial Words

chapter 11|28 pages

Correlations of Partial Words

chapter 12|20 pages

Unavoidable Sets of Partial Words

chapter |24 pages

Solutions to Selected Exercises