Find a copy online
Links to this item
Find a copy in the library
Finding libraries that hold this item...
Details
| Material Type: | Internet resource |
|---|---|
| Document Type: | Book, Internet Resource |
| All Authors / Contributors: |
Ian Chiswell |
| ISBN: | 9781848009394 1848009399 1848009402 9781848009400 |
| OCLC Number: | 244653221 |
| Description: | ix, 157 p. : ill. ; 24 cm. |
| 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. |
| Series Title: | Universitext. |
| Responsibility: | Ian Chiswell. |
Reviews
Publisher Synopsis
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) Read more...
Tags
Similar Items
Related Subjects:(6)
- Formal languages.
- Machine theory.
- Group theory.
- Formale Sprache.
- Gruppentheorie.
- Rekursive Funktion.

