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.Proposition 7.1.7 Let X C Aaquot; be a code and let C C Aaquot; be a conjugacy class that meets Xaquot;. Then 2 I Card(Xa#39;aquot; r) c) 3 Icard(c). (1.5) m n mil Moreover equality holds if and only if the following two conditions are satisfied: (1) The exponent oftheanbsp;...
|Title||:||Codes and Automata|
|Author||:||Jean Berstel, Dominique Perrin, Christophe Reutenauer|
|Publisher||:||Cambridge University Press - 2010-01|