Noncommutative rational series with applications / Jean Berstel, Christophe Reutenauer.

By:

Berstel, Jean, 1941-

Contributor(s):

Reutenauer, Christophe

Material type: Text

TextSeries: Encyclopedia of mathematics and its applications ; 137Publication details: Cambridge ; New York : Cambridge University Press, 2011.Description: xiii, 248 p. : ill. ; 24 cmISBN:

9780521190220 (hardback)

Subject(s):

DDC classification:

511.3/5 22

LOC classification:

QA267 .B47 2011

Online resources:

Cover image

Contents:

Machine 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.

Summary: "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"--Summary: "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"--

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Reference Books	CUTN Central Library Reference	Reference	511.3/5 (Browse shelf(Opens below))	Not For Loan		24099

Includes bibliographical references (p. [234]-241) and index.

"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 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"--

There are no comments on this title.

to post a comment.