Noncommutative Rational Series with Applications
Seiten
2010
Cambridge University Press (Verlag)
978-0-521-19022-0 (ISBN)
Cambridge University Press (Verlag)
978-0-521-19022-0 (ISBN)
Starting where Schützenberger and Chomsky left off, the authors present to an audience of graduate students and researchers a modern account of the subject and its applications. This is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap.
The algebraic theory of automata was created by Schützenberger and Chomsky over 50 years ago and there has since been a great deal of development. Classical work on the theory to noncommutative power series has been augmented more recently to areas such as representation theory, combinatorial mathematics and theoretical computer science. This book presents to an audience of graduate students and researchers a modern account of the subject and its applications. The algebraic approach allows the theory to be developed in a general form of wide applicability. For example, number-theoretic results can now be more fully explored, in addition to applications in automata theory, codes and non-commutative algebra. Much material, for example, Schützenberger's theorem on polynomially bounded rational series, appears here for the first time in book form. This is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap.
The algebraic theory of automata was created by Schützenberger and Chomsky over 50 years ago and there has since been a great deal of development. Classical work on the theory to noncommutative power series has been augmented more recently to areas such as representation theory, combinatorial mathematics and theoretical computer science. This book presents to an audience of graduate students and researchers a modern account of the subject and its applications. The algebraic approach allows the theory to be developed in a general form of wide applicability. For example, number-theoretic results can now be more fully explored, in addition to applications in automata theory, codes and non-commutative algebra. Much material, for example, Schützenberger's theorem on polynomially bounded rational series, appears here for the first time in book form. This is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap.
Jean Berstel is Emeritus Professor of Computer Science in the Gaspard-Monge Institute at Université Paris-Est, France. Christophe Reutenauer is Professor of Mathematics in the Department of Mathematics at Université du Québec à Montréal.
Preface; Part I. Rational Series: 1. Rational series; 2. Minimization; 3. Series and languages; 4. Rational expressions; Part II. Arithmetic: 5. Automatic sequences and algebraic series; 6. Rational series in one variable; 7. Changing the semiring; 8. Positive series in one variable; Part III. Applications: 9. Matrix semigroups and applications; 10. Noncommutative polynomials; 11. Codes and formal series; 12. Semisimple syntactic algebras; Open problems and conjectures; References; Index of notation; Index.
| Erscheint lt. Verlag | 14.10.2010 |
|---|---|
| Reihe/Serie | Encyclopedia of Mathematics and its Applications |
| Zusatzinfo | Worked examples or Exercises; 3 Line drawings, black and white |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 160 x 240 mm |
| Gewicht | 540 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Algebra |
| ISBN-10 | 0-521-19022-3 / 0521190223 |
| ISBN-13 | 978-0-521-19022-0 / 9780521190220 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
