000			02079nam a22003738i 4500
001			CR9780511566097
003			UkCbUP
005			20200124160232.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090518s1983||||enk o ||1 0|eng|d
020			_a9780511566097 (ebook)
020			_z9780521599245 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA164 _b.L67 1983
082	0	0	_a511/.6 _221
100	1		_aLothaire, M., _eauthor.
245	1	0	_aCombinatorics on words / _cM. Lothaire ; foreword by Roger Lyndon.
250			_aSecond edition.
264		1	_aCambridge : _bCambridge University Press, _c1983.
300			_a1 online resource (xvii, 238 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge mathematical library
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aCombinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment of this theory. All of the main results and techniques are covered. The presentation is accessible to undergraduate and graduate level students in mathematics and computer science as well as to specialists in all branches of applied mathematics. Topics discussed include: Thue's square free words, Van der Waerden's theorem, Ramsey's theorem; factorization of free monoids including application to free Lie algebras; equations in words, etc.
650		0	_aCombinatorial analysis.
650		0	_aWord problems (Mathematics)
700	1		_aLyndon, Roger C., _ewriter of foreword.
776	0	8	_iPrint version: _z9780521599245
830		0	_aCambridge mathematical library.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511566097
999			_c517694 _d517692