Order Total (1 Item Items):
Shipping Destination:
Automata Formal Languages Programming by Ling Zhou (1 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (1)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (1)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (1)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (No further results match this refinement)
- Not Print on Demand (1)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Automata and Formal Languages ??and Programming(Chinese Edition)
Published by Harbin Institute of Technology Press, 2014
ISBN 10: 7566107534 ISBN 13: 9787566107534
Language: Chinese
US$ 54.25
Convert currencyUS$ 18.00 shipping from China to U.S.A.Quantity: 3 available
Add to basketpaperback. Condition: New. Paperback. Pub Date :2014-02-01 Pages: 164 Language: Chinese Publisher: Harbin Institute of Technology Press. Automata and Formal Languages ??and Programming describes four examples of grammar and the corresponding grammar system. and infinite automata. pushdown machine. Turing machines and corresponding instance. Use VC + +6.0 achieve a given sentence grammar generated to determine the finite automata. finite automata uncertain. with empty transfer finite automata with output finite state au.
