Combinatorics on Words. Progress and Perspectives

Content: 
Front Matter, Page iii
Copyright, Page iv
CONTRIBUTORS, Pages vii-viii
PREFACE, Page ix
ACKNOWLEDGMENTS, Page x
THUE SYSTEMS AND THE CHURCH-ROSSER PROPERTY: REPLACEMENT SYSTEMS, SPECIFICATION OF FORMAL LANGUAGES, AND PRESENTATIONS OF MONOIDS, Pages 1-38, Ronald V. Book
ON RICH WORDS, Pages 39-61, Kevin J. Compton
TESTS SUR LES MORPHISMES FAIBLEMENT SANS CARRE, Pages 63-89, Max Crochemore
IRREDUCIBLE BINARY SEQUENCES, Pages 91-100, Earl D. Fife
ON THE STRUCTURE AND EXTENDIBILITY OF SQUARE-FREE WORDS, Pages 101-118, R.O. Shelton
OVERLAPPING OF WORDS IN RATIONAL LANGUAGES, Pages 119-131, Jorge Almeida
CODES CIRCULAIRES, Pages 133-165, J. Berstet, D. Perrin
POLYNOMIALLY BOUNDED DOL SYSTEMS YIELD CODES, Pages 167-174, Tom Head, G. Thierrin
SOME PROBLEMS RELATED TO THE ENCODING OF PREFIX CODES, Pages 175-193, Gerard Lallement
CONCATENATION HIERARCHIES DECIDABILITY RESULTS AND PROBLEMS, Pages 195-228, Jean-Eric Pin
A GENERAL EXPRESSION FOR ABELIAN IDENTITIES, Pages 229-245, Andrei Z. Broder
ON SOME COMBINATORIAL PROPERTIES OF METRICS OVER THE FREE MONOID, Pages 247-255, C. Choffrut
AN ENUMERATIVE INTERPRETATION OF THE SCHOLTZ CONSTRUCTION FOR COMMA-FREE CODES, Pages 257-277, J.S. Devitt
THE BURNSIDE PROBLEM FOR SEMIGROUPS OF MATRICES, Pages 279-295, Howard Straubing
SUBWORD COUNTING AND NILPOTENT GROUPS, Pages 297-305, Denis Thérien
AMBIGUITY TYPES OF FORMAL GRAMMARS, Pages 307-331, K. Culik, I.A. Natour
FINITE LANGUAGES AND THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC STRUCTURES, Pages 333-355, H.B. Hunt III
BRACKET-CONTEXT TREE FUNCTIONS, Pages 357-385, Pawel Radzikowski
UNIVERSAL TRAVERSAL SEQUENCES, GRAPH TRAVERSAL AND GRAPH IDENTIFICATION, Pages 387-405, Dana Richards, Charles Swart