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

Lingua: inglese

Editore: Springer London Ltd, England, 2009

1848009399 / 9781848009394

Serie: Libro 52 di 261 - Universitext

Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Venditore con 5 stelle

Venditore AbeBooks dal 22 giugno 2007

Brossura

Condizione: Nuovo

EUR 81,82

EUR 33,74 spedizione 
Spedito da Australia a U.S.A.

Quantità: 1 disponibile

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

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.…

Titolo
A Course in Formal Languages, Automata and Groups (Paperback)
Autore
Ian M. Chiswell
Editore
Springer London Ltd, England
Anno di pubblicazione
2009
Condizione
new
Rilegatura
Paperback
Lingua
inglese
ISBN 10
1848009399
ISBN 13
9781848009394
Serie
Libro 52 di 261: Universitext

AussieBookSeller

Truganina, VIC, Australia

Venditore con 5 stelle

Venditore AbeBooks dal 22 giugno 2007

Tariffe di spedizione da Australia a U.S.A.

ArticoloDa 25 a 45 giorni lavorativiDa 8 a 14 giorni lavorativi
Primo articoloEUR 33,74EUR 40,12
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

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

Informazioni sull’azienda del venditore

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029