A Course in Formal Languages, Automata and Groups (Paperback)

Idioma: inglés

Editorial: Springer London Ltd, England, 2009

1848009399 / 9781848009394

Serie: Libro 52 de 261 - Universitext

  • Tapa blanda
  • Nuevo
Ver todos los detalles

Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tapa blanda

Condición: Nuevo

EUR 82,49

Envío por EUR 33,72 
Se envía de Australia a Estados Unidos de America

Cantidad disponible: 1 disponible

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

Paperback. This book is based on notes for a masters 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. This book is based on notes for a masters 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Título
A Course in Formal Languages, Automata and Groups (Paperback)
Autor
Ian M. Chiswell
Editorial
Springer London Ltd, England
Año de publicación
2009
Estado
new
Encuadernación
Paperback
Idioma
inglés
ISBN 10
1848009399
ISBN 13
9781848009394
Serie
Libro 52 de 261: Universitext

AussieBookSeller

Truganina, VIC, Australia

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tarifas de envío de Australia a Estados Unidos de America

ArtículoDe 25 a 45 días hábilesDe 8 a 14 días hábiles
Primer artículoEUR 33,72EUR 40,10
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029