Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Codes and Automata - Jean Berstel, Dominique Perrin, Christophe Reutenauer

Codes and Automata

Buch | Hardcover
634 Seiten
2009
Cambridge University Press (Verlag)
978-0-521-88831-8 (ISBN)
CHF 277,55 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
A major revision of Berstel and Perrin's classic Theory of Codes, this book has been written with a more modern focus and a much broader coverage of the subject. It is a comprehensive reference on the theory of variable-length codes and their relation to 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 sum this is a comprehensive reference on the theory of variable-length codes and their relation to automata.

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.

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.

Erscheint lt. Verlag 5.11.2009
Reihe/Serie Encyclopedia of Mathematics and its Applications
Zusatzinfo Worked examples or Exercises; 30 Tables, unspecified; 1 Halftones, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 160 x 240 mm
Gewicht 1080 g
Themenwelt Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Graphentheorie
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 0-521-88831-X / 052188831X
ISBN-13 978-0-521-88831-8 / 9780521888318
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich