MARC Record from Library of Congress

LEADER: 03636cam a2200301 a 4500
001 2010030398
003 DLC
005 20120901081858.0
008 100716s2011 enka b 001 0 eng
010 $a 2010030398
020 $a9780521190220 (hardback)
040 $aDLC$cDLC$dDLC
042 $apcc
050 00 $aQA267$b.B47 2011
082 00 $a511.3/5$222
100 1 $aBerstel, Jean,$d1941-
245 10 $aNoncommutative rational series with applications /$cJean Berstel, Christophe Reutenauer.
260 $aCambridge ;$aNew York :$bCambridge University Press,$c2011.
300 $axiii, 248 p. :$bill. ;$c24 cm.
490 0 $aEncyclopedia of mathematics and its applications ;$v137
520 $a"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"--$cProvided by publisher.
520 $a"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 of 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 noncommutative algebra. Much material, for example, Schützenberger's theorem on polynomially bounded rational series, and results on semi simple algebras, appear here for the first time in book form. In sum, this is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap"--$cProvided by publisher.
504 $aIncludes bibliographical references (p. [234]-241) and index.
505 8 $aMachine generated contents note: 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.
650 0 $aMachine theory.
650 0 $aNoncommutative algebras.
700 1 $aReutenauer, Christophe.
856 42 $3Cover image$uhttp://assets.cambridge.org/97805211/90220/cover/9780521190220.jpg