Combinatorics on Words - 1st Edition - ISBN: 9780121988203, 9781483264684

Combinatorics on Words

1st Edition

Progress and Perspectives

Editors: Larry J. Cummings
eBook ISBN: 9781483264684
Imprint: Academic Press
Published Date: 28th January 1983
Page Count: 416
Tax/VAT will be calculated at check-out Price includes VAT (GST)
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
54.95
38.47
38.47
38.47
38.47
38.47
43.96
43.96
43.99
30.79
30.79
30.79
30.79
30.79
35.19
35.19
72.95
51.06
51.06
51.06
51.06
51.06
58.36
58.36
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Description

Combinatorics on Words: Progress and Perspectives covers the proceedings of an international meeting by the same title, held at the University of Waterloo, Canada on August 16-22, 1982. This meeting highlights the diverse aspects of combinatorics on words, including the Thue systems, topological dynamics, combinatorial group theory, combinatorics, number theory, and computer science.

This book is organized into four parts encompassing 19 chapters. The first part describes the Thue systems with the Church-Rosser property. A Thue system will be called “Church-Rosser” if two strings are congruent with respect to that system if and only if they have a common descendant, that is, a string that can be obtained applying only rewriting rules that reduce length. The next part deals with the problems related to the encoding of codes and the overlapping of words in rational languages. This part also explores the features of polynomially bounded DOL systems yield codes. These topics are followed by discussions of some combinatorial properties of metrics over the free monoid and the burnside problem of semigroups of matrices. The last part considers the ambiguity types of formal grammars, finite languages, computational complexity of algebraic structures, and the Bracket-context tree functions.

This book will be of value to mathematicians and advance undergraduate and graduate students.

Table of Contents


Contributors

Preface

Acknowledgments

Thue Systems and Thue Sequences

Thue Systems and the Church-Rosser Property: Replacement Systems, Specification of Formal Languages, and Presentations of Monoids

On Rich Words

Tests Sur Les Morphismes Faiblement Sans Carré

Irreducible Binary Sequences

On the Structure and Extendibility of Square-Free Words

Codes and Languages

Overlapping of Words in Rational Languages

Codes Circulaires

Polynomially Bounded DOL Systems Yield Codes

Some Problems Related to the Encoding of Prefix Codes

Concatenation Hierarchies: Decidability Results and Problems

Combinatorics and Enumeration

A General Expression for Abelian Identities

On Some Combinatorial Properties of Metrics Over the Free Monoid

An Enumerative Interpretation of the Scholtz Construction for Comma-Free Codes

The Burnside Problem for Semigroups of Matrices

Subword Counting and Nilpotent Groups

Automata and Grammars

Ambiguity Types of Formal Grammars

Finite Languages and the Computational Complexity of Algebraic Structures

Bracket-Context Tree Functions

Universal Traversal Sequences, Graph Traversal and Graph Identification

Details

No. of pages:
416
Language:
English
Copyright:
© Academic Press 1983
Published:
Imprint:
Academic Press
eBook ISBN:
9781483264684

About the Editor

Larry J. Cummings