Contacto
Cómo comprar
Entrega
Guía de compras
Course in Formal Languages, Automata and Groups
Inglés
136 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
39.39
€
/
Tapa blanda
15.09
€
/
Tapa blanda
7.99
€
/
Tapa blanda
47.99
€
/
Tapa dura
34.79
€
/
Tapa blanda
21.99
€
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 in the ?rst three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Three such notions are considered. These are: generated by a type 0 grammar, recognised by a Turing machine (deterministic or not) and de?ned by means of a Godel numbering, having de?ned recursively enumerable for sets of natural numbers. It is hoped that this has been achieved without too many ar- ments using complicated notation. This is a problem with the entire subject, and it is important to understand the idea of the proof, which is often quite simple. 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.
Sobre el libro
Inglés
Categorías
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Adobe ePub DRM
1.19
€
/
Tapa blanda
21.79
€
/
Tapa blanda
26.59
€
