Presents easily accessible coverage of language theory, concentrating on the major properties of the fundamental and automata models for languages. Focuses on practical applications such as finite automata and pattern matching, regular expressions and text editing, extended context-free grammars, and syntax diagrams. Simple and elegant proofs are given for theorems usually considered difficult (e.g., Parikh's theorem or the proof that every finite automata has an equivalent regular expression). Provides algorithms in a Pascal-like notation which complement discussions of constructions and programming. Each chapter includes a springboard section introducing topics for further investigation. Also provides short exercises and programming projects plus extensive examples.
"synopsis" may belong to another edition of this title.
Shipping:
US$ 4.50
Within U.S.A.
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: Good. *Price HAS BEEN REDUCED by 10% until Monday, April 14 (weekend SALE item)* 576 pp., Hardcover, ex library, else text and binding clean and tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1277443
Quantity: 1 available
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.68. Seller Inventory # G0471603511I4N00
Quantity: 1 available