A Course in Formal Languages, Automata and Groups
Author:   Ian M. Chiswell ,  Sheldon Axler ,  Vincenzo Capasso ,  Carles Casacuberta
Publisher:   Springer London Ltd
Edition:   2009 ed.
ISBN:  

9781848009394


Pages:   157
Publication Date:   06 February 2009
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $131.87 Quantity:  
Add to Cart

Share |

A Course in Formal Languages, Automata and Groups


Add your own review!

Overview

Full Product Details

Author:   Ian M. Chiswell ,  Sheldon Axler ,  Vincenzo Capasso ,  Carles Casacuberta
Publisher:   Springer London Ltd
Imprint:   Springer London Ltd
Edition:   2009 ed.
Dimensions:   Width: 15.50cm , Height: 0.90cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9781848009394


ISBN 10:   1848009399
Pages:   157
Publication Date:   06 February 2009
Audience:   College/higher education ,  Postgraduate, Research & Scholarly ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Preface.- Contents.- 1. Grammars and Machine Recognition.- 2. Recursive Functions.- 3. Recursively Enumerable Sets and Languages.- 4. Context-free language.- 5. Connections with Group Theory.- A. Results and Proofs Omitted in the Text.- B. The Halting Problem and Universal Turing Machines.- C. Cantor's Diagonal Argument.- D. Solutions to Selected Exercises.- References.- Index.

Reviews

From the reviews: This short work by Chiswell ! covers formal languages, automata theory, and the word problem in group theory. This content is bound together by the unifying theme of what is known as Church's thesis, which states that any desirable definition of computability should coincide with recursiveness. ! Several appendixes serve as homes for ! distracting proofs of results needed in the main body of the text, or for solutions to selected instances of the abundant exercises. Summing Up: Recommended. Academic readers, upper-division undergraduates through researchers/faculty. (F. E. J. Linton, Choice, Vol. 46 (11), 2009)


From the reviews: This short work by Chiswell ... covers formal languages, automata theory, and the word problem in group theory. This content is bound together by the unifying theme of what is known as Church's thesis, which states that any desirable definition of computability should coincide with recursiveness. ... Several appendixes serve as homes for ... distracting proofs of results needed in the main body of the text, or for solutions to selected instances of the abundant exercises. Summing Up: Recommended. Academic readers, upper-division undergraduates through researchers/faculty. (F. E. J. Linton, Choice, Vol. 46 (11), 2009)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now