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

Language: English

Published by Springer London Ltd, England, 2009

1848009399 / 9781848009394

Series: Book 52 of 261 - Universitext

  • Softcover
  • New
See all details

Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail

5-star seller

AbeBooks seller since October 12, 2005

Softcover

Condition: New

US$ 73.14

 Free Shipping 
Ships within U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

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 multiple locations in the US or from the UK, depending on stock availability.…

Title
A Course in Formal Languages, Automata and Groups (Paperback)
Author
Ian M. Chiswell
Publisher
Springer London Ltd, England
Publication year
2009
Condition
new
Binding
Paperback
Language
English
ISBN 10
1848009399
ISBN 13
9781848009394
Series
Book 52 of 261: Universitext

Grand Eagle Retail

Bensenville, IL, U.S.A.

5-star seller

AbeBooks seller since October 12, 2005

Shipping rates within U.S.A.

Item6 to 14 business days6 to 16 business days
First itemUS$ 0.00US$ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

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

Seller's business information

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE U.S.A. 19805