000			03655nam a22003738i 4500
001			CR9781107326019
003			UkCbUP
005			20200124160239.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			130129s2002||||enk o ||1 0|eng|d
020			_a9781107326019 (ebook)
020			_z9780521812207 (hardback)
020			_z9780521180719 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA164 _b.L65 2002
082	0	0	_a511/.6 _221
100	1		_aLothaire, M., _eauthor.
245	1	0	_aAlgebraic combinatorics on words / _cM. Lothaire.
264		1	_aCambridge : _bCambridge University Press, _c2002.
300			_a1 online resource (xiii, 504 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aEncyclopedia of mathematics and its applications ; _vvolume 90
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0	0	_tFinite and Infinite Words -- _tSemigroups -- _tWords -- _tAutomata -- _tGenerating series -- _tSymbolic dynamical systems -- _tUnavoidable sets -- _tSturmian Words -- _tEquivalent definitions -- _tStandard words -- _tSturmian morphisms -- _tUnavoidable Patterns -- _tDefinitions and basic properties -- _tDeciding avoidability: the Zimin algorithm -- _tAvoidability on a fixed alphabet -- _tSesquipowers -- _tBi-ideal sequences -- _tCanonical factorizations -- _tSesquipowers and recurrence -- _tExtensions of a theorem of Shirshov -- _tFiniteness conditions for semigroups -- _tThe Plactic Monoid -- _tSchensted's algorithm -- _tGreene's invariants and the plactic monoid -- _tThe Robinson--Schensted--Knuth correspondence -- _tSchur functions and the Littlewood--Richardson rule -- _tCoplactic operations -- _tCyclage and canonical embeddings -- _tCodes -- _tX-factorizations -- _tDefect -- _tMore defect -- _tA theorem of Schutzenberger -- _tNumeration Systems -- _tStandard representation of numbers -- _tBeta-expansions -- _tU-representations -- _tRepresentation of complex numbers -- _tPeriodicity -- _tPeriods in a finite word -- _tLocal versus global periodicity -- _tInfinite words -- _tCentralizers of Noncommutative Series and Polynomials -- _tCohn's centralizer theorem -- _tEuclidean division and principal right ideals -- _tIntegral closure of the centralizer -- _tHomomorphisms into k[t] -- _tBergman's centralizer theorem -- _tFree subalgebras and the defect theorem -- _tAppendix: some commutative algebra -- _tTransformations on Words and q-Calculus -- _tThe q-binomial coefficients -- _tThe MacMahon Verfahren.
520			_aCombinatorics 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	_aCombinatorial analysis.
650		0	_aWord problems (Mathematics)
776	0	8	_iPrint version: _z9780521812207
830		0	_aEncyclopedia of mathematics and its applications ; _vv. 90.
856	4	0	_uhttps://doi.org/10.1017/CBO9781107326019
999			_c518386 _d518384