Items related to Automata and Formal Languages ??and Programming(Chinese...
Synopsis
Paperback. Pub Date :2014-02-01 164 Chinese 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 automata. pushdown automata. OK pushdown automata. basic Turing machine. Turing machines with calculating functions. state storage symbol Turing machine. multi-channel Turing machine. Turing machine has a subroutine. Automata and Formal Languages ??and Programming is characterized by the use of computers to achieve a given grammatical sentences generated by computer simulation of some auto...
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 54.25
US$ 18.00 shipping from China to U.S.A.
Destination, rates & speedsSearch results for Automata and Formal Languages ??and Programming(Chinese...
Stock Image
Automata and Formal Languages ??and Programming(Chinese Edition)
Published by
Harbin Institute of Technology Press, 2014
ISBN 10: 7566107534
ISBN 13: 9787566107534
New
paperback
Seller: liu xing, Nanjing, JS, China
Seller rating 5 out of 5 stars
paperback. 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. Seller Inventory # BX055377
Quantity: 3 available