Tell your friends about this item:
A Course in Formal Languages, Automata and Groups - Universitext Ian M. Chiswell 2009 edition
A Course in Formal Languages, Automata and Groups - Universitext
Ian M. Chiswell
This book is based on notes for a master's course given at Queen Mary, University of London, in the 1998/9 session. Two particular places that are heavy going are the proof at the end of Chapter 1 that a language recognised by a Turing machine is type 0, and the proof in Chapter 2 that a Turing machine computable function is partial recursive.
168 pages, 30 black & white illustrations, 2 black & white tables, biography
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | February 6, 2009 |
| Original release date | 2008 |
| ISBN13 | 9781848009394 |
| Publishers | Springer London Ltd |
| Pages | 157 |
| Dimensions | 155 × 235 × 9 mm · 272 g |
| Language | English |
| Series Editor | Axler, Sheldon |
| Series Editor | Capasso, Vincenzo |
| Series Editor | Casacuberta, Carles |
| Series Editor | Macintyre, Angus J. |
| Series Editor | Ribet, Kenneth |
| Series Editor | Sabbah, Claude |
| Series Editor | Suli, Endre |