Algebraic combinatorics on words / M. Lothaire.

Show other versions (2)

Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinato...

Full description

Bibliographic Details
Main Author: Lothaire, M. (Author)
Language:English
Published: Cambridge : Cambridge University Press, 2002.
Series:Encyclopedia of mathematics and its applications ; v. 90.
Subjects:
Combinatorial analysis.
Word problems (Mathematics)
Online Access:
Connect to online resource - MSU authorized users (Digital Object Identifier Permalink)
Physical Description:1 online resource (xiii, 504 pages) : digital, PDF file(s).
Format: Electronic eBook

MARC

LEADER 00000nam a22000008i 4500
001 in00005574842
003 OCoLC
005 20220616145011.0
006 m|||||o||d||||||||
007 cr |||||||||||
008 130129s2002||||enk o ||1 0|eng|d
020 |a 9781107326019 (ebook) 
020 |z 9780521812207 (hardback) 
020 |z 9780521180719 (paperback) 
035 |a CR9781107326019 
040 |a UkCbUP  |b eng  |e rda  |c UkCbUP  |d UtOrBLW 
049 |a QEMP 
050 0 0 |a QA164  |b .L65 2002 
082 0 0 |a 511/.6  |2 21 
100 1 |a Lothaire, M.,  |e author.  |0 http://id.loc.gov/authorities/names/n82155861 
245 1 0 |a Algebraic combinatorics on words /  |c M. Lothaire. 
264 1 |a Cambridge :  |b Cambridge University Press,  |c 2002. 
300 |a 1 online resource (xiii, 504 pages) :  |b digital, PDF file(s). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Encyclopedia of mathematics and its applications ;  |v volume 90 
500 |a Title from publisher's bibliographic system (viewed on 05 Oct 2015). 
505 0 0 |t Finite and Infinite Words --  |t Semigroups --  |t Words --  |t Automata --  |t Generating series --  |t Symbolic dynamical systems --  |t Unavoidable sets --  |t Sturmian Words --  |t Equivalent definitions --  |t Standard words --  |t Sturmian morphisms --  |t Unavoidable Patterns --  |t Definitions and basic properties --  |t Deciding avoidability: the Zimin algorithm --  |t Avoidability on a fixed alphabet --  |t Sesquipowers --  |t Bi-ideal sequences --  |t Canonical factorizations --  |t Sesquipowers and recurrence --  |t Extensions of a theorem of Shirshov --  |t Finiteness conditions for semigroups --  |t The Plactic Monoid --  |t Schensted's algorithm --  |t Greene's invariants and the plactic monoid --  |t The Robinson--Schensted--Knuth correspondence --  |t Schur functions and the Littlewood--Richardson rule --  |t Coplactic operations --  |t Cyclage and canonical embeddings --  |t Codes --  |t X-factorizations --  |t Defect --  |t More defect --  |t A theorem of Schutzenberger --  |t Numeration Systems --  |t Standard representation of numbers --  |t Beta-expansions --  |t U-representations --  |t Representation of complex numbers --  |t Periodicity --  |t Periods in a finite word --  |t Local versus global periodicity --  |t Infinite words --  |t Centralizers of Noncommutative Series and Polynomials --  |t Cohn's centralizer theorem --  |t Euclidean division and principal right ideals --  |t Integral closure of the centralizer --  |t Homomorphisms into k[t] --  |t Bergman's centralizer theorem --  |t Free subalgebras and the defect theorem --  |t Appendix: some commutative algebra --  |t Transformations on Words and q-Calculus --  |t The q-binomial coefficients --  |t The MacMahon Verfahren. 
520 |a Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers. 
650 0 |a Combinatorial analysis.  |0 http://id.loc.gov/authorities/subjects/sh85028802 
650 0 |a Word problems (Mathematics)  |0 http://id.loc.gov/authorities/subjects/sh85148106 
776 0 8 |i Print version:  |a Lothaire, M.  |t Algebraic combinatorics on words  |z 9780521812207. 
830 0 |a Encyclopedia of mathematics and its applications ;  |v v. 90.  |0 http://id.loc.gov/authorities/names/n42010632 
856 4 0 |u http://ezproxy.msu.edu/login?url=http://dx.doi.org/10.1017/CBO9781107326019  |z Connect to online resource - MSU authorized users  |t 0 
907 |y .b11943183x  |b 211128  |c 160728 
998 |a wb  |b 160728  |c m  |d a   |e -  |f eng  |g enk  |h 0  |i 3 
999 f f |i 8c3317f8-bf56-5df8-8db5-078224a27363  |s 22f6fd84-57ab-52ce-af69-2a866f1f4b49  |t 0 
952 f f |p Non-Circulating  |a Michigan State University-Library of Michigan  |b Michigan State University  |c MSU Online Resource  |d MSU Online Resource  |t 0  |e QA164 .L65 2002  |h Library of Congress classification  |i Electronic Resource  |j Online  |n 1 
856 4 0 |t 0  |u http://ezproxy.msu.edu/login?url=http://dx.doi.org/10.1017/CBO9781107326019  |y Connect to online resource - MSU authorized users