Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
This book covers substantially the central ideas of a one semester course in automata theory. It is oriented towards a mathematical perspective that is understandable to non-mathematicians. Comprehension is greatly aided by many examples, especially on the Chomsky - Schutzenberger theorem, which is not found in most books in this field.Synopsis
This book covers substantially the central ideas of a one semester course in automata theory. It is oriented towards a mathematical perspective that is understandable to non-mathematicians. Comprehension is greatly aided by many examples, especially on the Chomsky - Schutzenberger theorem, which is not found in most books in this field.
Booknews
A textbook for a one-semester graduate or undergraduate course for computer science students. Explains the theory of computability in order to prepare students to switch to systems beside the popular programming languages and operating systems most of them learn and use. Simon (San Jose State U., California) selects ideas from a number of different books and uses a unified notation. Annotation c. Book News, Inc., Portland, OR (booknews.com)