Codes and Automata
£159.00
Part of Encyclopedia of Mathematics and its Applications
- Authors:
- Jean Berstel, Université de Paris-Est
- Dominique Perrin, Université de Paris-Est
- Christophe Reutenauer, Université du Québec, Montréal
- Date Published: November 2009
- availability: In stock
- format: Hardback
- isbn: 9780521888318
£
159.00
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- Thoroughly updated to reflect developments and results in the field over the last twenty years
- A self-contained treatment containing complete proofs and over 250 illustrative examples
- Exercises and solutions allow the reader to test their understanding
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: November 2009
- format: Hardback
- isbn: 9780521888318
- length: 634 pages
- dimensions: 240 x 160 x 35 mm
- weight: 1.08kg
- contains: 1 b/w illus. 30 tables 210 exercises
- availability: In stock
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.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×