×


 x 

Shopping cart
Ian M. Chiswell - Course in Formal Languages, Automata and Groups - 9781848009394 - V9781848009394
Stock image for illustration purposes only - book cover, edition or condition may vary.

Course in Formal Languages, Automata and Groups

€ 65.09
FREE Delivery in Ireland
Description for Course in Formal Languages, Automata and Groups Paperback. This comprehensive text uniquely presents a thorough introduction into the connections between group theory and formal languages. It also offers precise definitions, clear and succinct proofs, and an account of the Muller-Schupp theorem. Series Editor(s): Axler, Sheldon; Capasso, Vincenzo; Casacuberta, Carles; Macintyre, Angus J.; Ribet, Kenneth; Sabbah, Claude; Suli, Endre. Series: Universitext. Num Pages: 166 pages, 30 black & white illustrations, 2 black & white tables, biography. BIC Classification: PBMS; PBPD. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 9. Weight in Grams: 245.
This book is based on notes for a master’s course given at Queen Mary, University of London, in the 1998/9 session. Such courses in London are quite short, and the course consisted essentially of the material in the ?rst three chapters, together with a two-hour lecture on connections with group theory. Chapter 5 is a considerably expanded version of this. For the course, the main sources were the books by Hopcroft and Ullman ([20]), by Cohen ([4]), and by Epstein et al. ([7]). Some use was also made of a later book by Hopcroft and Ullman ([21]). The ulterior motive ... Read more

Product Details

Format
Paperback
Publication date
2008
Publisher
Springer London Ltd United Kingdom
Number of pages
166
Condition
New
Series
Universitext
Number of Pages
157
Place of Publication
England, United Kingdom
ISBN
9781848009394
SKU
V9781848009394
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Course in Formal Languages, Automata and Groups
From the reviews: "This short work by Chiswell … covers formal languages, automata theory, and the word problem in group theory. This content is bound together by the unifying theme of what is known as Church’s thesis, which states that any desirable definition of computability should coincide with recursiveness. … Several appendixes serve as homes for … distracting ... Read more

Goodreads reviews for Course in Formal Languages, Automata and Groups


Subscribe to our newsletter

News on special offers, signed editions & more!