Recomienda este artículo a tus amigos:
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 6 de febrero de 2009 |
| Fecha de lanzamiento original | 2008 |
| ISBN13 | 9781848009394 |
| Editores | Springer London Ltd |
| Páginas | 157 |
| Dimensiones | 155 × 235 × 9 mm · 272 g |
| Lengua | Inglés |
| Editor de series | Axler, Sheldon |
| Editor de series | Capasso, Vincenzo |
| Editor de series | Casacuberta, Carles |
| Editor de series | Macintyre, Angus J. |
| Editor de series | Ribet, Kenneth |
| Editor de series | Sabbah, Claude |
| Editor de series | Suli, Endre |