Refine your search

  • Books (20)

to

Custom price range (US$)

to

Ian M Chiswell (20 results)

Author: 
Refine with Advanced Search
  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-

    5-star seller
    Contact seller

    Condition: Used - Good

    US$ 35.08

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International

    5-star seller
    Contact seller

    Condition: New

    US$ 58.21

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.Romtrade Corp.

    5-star seller
    Contact seller

    Condition: New

    US$ 58.21

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Books Puddle, Woodside, NY, U.S.A.Books Puddle

    4-star seller
    Contact seller

    Condition: Used

    US$ 56.91

    US$ 3.99 shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: Used. pp. 168.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Majestic Books, Hounslow, United KingdomMajestic Books

    4-star seller
    Contact seller

    Condition: Used

    US$ 55.96

    US$ 8.54 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Condition: Used. pp. 168 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

  • Language: English

    Published by Springer 2/6/2009, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores

    5-star seller
    Contact seller

    Condition: New

    US$ 65.34

     Free Shipping 
    Ships within U.S.A.

    Quantity: 5 available

    Paperback or Softback. Condition: New. A Course in Formal Languages, Automata and Groups. Book.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios

    4-star seller
    Contact seller

    Condition: Used

    US$ 58.81

    US$ 10.92 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Condition: Used. pp. 168.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: California Books, Miami, FL, U.S.A.California Books

    5-star seller
    Contact seller

    Condition: New

    US$ 72.00

    US$ 3.00 shipping 
    Ships within U.S.A.

    Quantity: Over 20 available

    Condition: New.

  • Language: English

    Published by Cambridge University Press, 2012

    1107024811 / 9781107024816

    Series: Book 20 of 46 - Cambridge Tracts in Mathematics

    • Hardcover

    Seller: Better World Books, Mishawaka, IN, U.S.A.Better World Books

    5-star seller
    Contact seller

    Condition: Used - Very good

    US$ 80.37

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections

    5-star seller
    Contact seller

    Condition: New

    US$ 75.76

    US$ 12.98 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: Over 20 available

    Condition: New. In English.

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    US$ 74.25

    US$ 38.40 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

  • Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: Home-set, Mannheim, GermanyHome-set

    5-star seller
    Contact seller

    Condition: New

    US$ 75.56

    US$ 54.75 shipping 
    Ships from Germany to U.S.A.

    Quantity: 2 available

    Softcover/Taschenbuch. Condition: Neu. 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. Sprache: Englisch Gewicht in Gramm: 265.…

  • More images

    Language: English

    Published by Springer, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    US$ 57.24

    US$ 76.80 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: Neu. A Course in Formal Languages, Automata and Groups | Ian M. Chiswell | Taschenbuch | Universitext | ix | Englisch | 2009 | Springer | EAN 9781848009394 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

  • Language: English

    Published by Springer 2009-02, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

    Seller: Chiron Media, Wallingford, United KingdomChiron Media

    5-star seller
    Contact seller

    Condition: New

    US$ 64.35

    US$ 5.90 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 20 available

    PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

  • Language: English

    Published by Springer London Ltd, England, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

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

    5-star seller
    Contact seller

    Condition: New

    US$ 73.14

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Paperback. Condition: new. 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.…

  • Language: English

    Published by Springer London Feb 2009, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

    Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

    5-star seller
    Contact seller

    Condition: New

    US$ 60.44

    US$ 25.23 shipping 
    Ships from Germany to U.S.A.

    Quantity: 2 available

    Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 168 pp. Englisch.…

  • Language: English

    Published by Springer London, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

    Seller: moluna, Greven, Germanymoluna

    5-star seller
    Contact seller

    Condition: New

    US$ 53.38

    US$ 53.75 shipping 
    Ships from Germany to U.S.A.

    Quantity: Over 20 available

    Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Most books on formal languages and automata are written for undergraduates in computer science in contrast, this book provides a rigorous text aimed at the postgraduate-level mathematician with precise definitions and clear and succinct proofs.Th.…

  • Language: English

    Published by Springer London Ltd, England, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

    Seller: CitiRetail, Stevenage, United KingdomCitiRetail

    5-star seller
    Contact seller

    Condition: New

    US$ 75.13

    US$ 48.64 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Paperback. Condition: new. 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 UK warehouse or from our Australian or US warehouses, depending on stock availability.…

  • Language: English

    Published by Springer, Springer Feb 2009, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

    Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

    5-star seller
    Contact seller

    Condition: New

    US$ 60.44

    US$ 65.83 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 168 pp. Englisch.…

  • Language: English

    Published by Springer London Ltd, England, 2009

    1848009399 / 9781848009394

    Series: Book 52 of 261 - Universitext

    • Softcover
    • Print on Demand

    Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

    5-star seller
    Contact seller

    Condition: New

    US$ 90.51

    US$ 37.00 shipping 
    Ships from Australia to U.S.A.

    Quantity: 1 available

    Paperback. Condition: new. 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.…