Textbook for an undergraduate one-semester course dealing with formal languages, finite automata, and theoretical computing. Examples and problems. Annotation copyright Book News, Inc. Portland, Or.
Read More
Textbook for an undergraduate one-semester course dealing with formal languages, finite automata, and theoretical computing. Examples and problems. Annotation copyright Book News, Inc. Portland, Or.
Read Less
Add this copy of Formal Languages and Automata Theory to cart. $28.27, fair condition, Sold by Anybook rated 4.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 1989 by Computer Science Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 700grams, ISBN: 0716781867.
Add this copy of Formal Languages and Automata Theory (Principles of to cart. $51.20, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1989 by Computer Science Pr.
Add this copy of Formal Languages and Automa Theory to cart. $62.95, good condition, Sold by RareNonFiction rated 5.0 out of 5 stars, ships from Ladysmith, BC, CANADA, published 1989 by Computer Science Press/Freeman and Company.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. 0716781867. 321 pages including index. Covers concepts of formal language, finite automa, and theoretical computing, without an overwhelming presentation of more technical and specialized material. Covers grammatical descriptions of languages and their classification, finite state machines, push-down automata, regular languages, Turing machines, elements of parsing techniques, and an introduction to the theory of computation. Assumes only a minimal background in "set theoretic etiquette" and includes two appendices for additional help with sets and Pascal. Light wear. Faint erasure to front endpaper. Moderate quantities of markings and underlining. Glossy white boards. Solid copy.; 8vo-over 7¾"-9¾" tall; Formal Languages and Automa Theory 321 pages including index. Covers concepts of formal language, finite automa, and theoretical computing, without an overwhelming presentation of more technical and specialized material. Covers grammatical descriptions.
