Elementary Computability, Formal Languages, and Automata

Front Cover
Prentice-Hall, 1982 - Mathematics - 400 pages
0 Reviews
Emphasizes the theory of computability & the theory of formal languages. Uses automata as precise models of computation in studies that have actual computers as their primary application.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

TURING MACHINES
23
COMPUTABLE FUNCTIONS
84
GODEL NUMBERING AND CHURCHS
148
Copyright

10 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information