Codes and Automata
This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In summary, this is a comprehensive reference on the theory of variable-length codes and their relation to automata.
1142931138
Codes and Automata
This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In summary, this is a comprehensive reference on the theory of variable-length codes and their relation to automata.
217.0 In Stock
Codes and Automata

Codes and Automata

Overview

This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In summary, this is a comprehensive reference on the theory of variable-length codes and their relation to automata.

Product Details

ISBN-13: 9780521888318
Publisher: Cambridge University Press
Publication date: 11/05/2009
Series: Encyclopedia of Mathematics and its Applications , #129
Pages: 634
Product dimensions: 6.00(w) x 9.20(h) x 1.50(d)

About the Author

Jean Berstel is Emeritus Professor of Computer Science at the Institut Gaspard-Monge in the University of Marne-la-Vallée, France.

Dominique Perrin is Professor in Computer Science at the University of Marne-la-Vallée, France, and director of ESIEE Engineering, Paris. He is a member of Academia Europea.

Christophe Reutenauer is Professor of Mathematics in the Combinatorics and Mathematical Computer Science Laboratory (LaCIM) at the University of Québec, Montréal.

Table of Contents

Preface; 1. Preliminaries; 2. Codes; 3. Prefix codes; 4. Automata; 5. Deciphering delay; 6. Bifix codes; 7. Circular codes; 8. Factorizations of free monoids; 9. Unambiguous monoids of relations; 10. Synchronization; 11. Groups of codes; 12. Factorizations of cyclic groups; 13. Densities; 14. Polynomials of finite codes; Solutions of exercises; Appendix: Research problems; References; Index of notation; Index.
From the B&N Reads Blog
Page 1 of

Customer Reviews