DROBOT, VLADIMIR - Formal Languages and Automa Theory

New York: Computer Science Press/Freeman and Company, 1989. Reprint. Hardcover. ISBN: 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. Very Good .

See/Hide Conditions of Sale

Following conditions of sale apply:
Terms of Sale

We pack securely in sturdy cardboard cartons and insure all shipments. Books shipped when payment received. Shipments to the U.S.:  Tariffs on any items published outside the U.S. are payable by the recipient.

Methods of Payment Accepted: Visa, Mastercard, American Express, Paypal, international money order in $US or $CAD, cash.

Return Policy: If your book was misdescribed, your purchase price, including shipping, will be fully refunded when we receive the book back. If you wish to return your book for any other reason within 30 days of receipt, we will refund book price (not shipping) when book is safely returned to us. Please contact us before returning your book.