Kanchi suresh (10 resultados)

Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. Neuware - The Book overing finite automata, regular languages, grammars, context-free languages, pushdown automata, Turing machines, decidability, recursive functions, and complexity theory.Clear explanations supported by diagrams and step-by-step derivationsWorked examples to strengthen conceptual understandingSolved and unsolved exercises for practiceSummary sections for quick revision.Theory of Computation of Formal Languages and Automata Theory included variety of examples solved, exercise, suitable for B.Tech, M.Tech students of Computer Science, IT, etc.…

Buch. Condición: Neu. Neuware - The Book overing finite automata, regular languages, grammars, context-free languages, pushdown automata, Turing machines, decidability, recursive functions, and complexity theory.Clear explanations supported by diagrams and step-by-step derivationsWorked examples to strengthen conceptual understandingSolved and unsolved exercises for practiceSummary sections for quick revision.Theory of Computation of Formal Languages and Automata Theory included variety of examples solved, exercise, suitable for B.Tech, M.Tech students of Computer Science, IT, etc.…

PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

HRD. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

HRD. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Paperback. Condición: new. Paperback. The Book overing finite automata, regular languages, grammars, context-free languages, pushdown automata, Turing machines, decidability, recursive functions, and complexity theory.Clear explanations supported by diagrams and step-by-step derivationsWorked examples to strengthen conceptual understandingSolved and unsolved exercises for practiceSummary sections for quick revision.Theory of Computation of Formal Languages and Automata Theory included variety of examples solved, exercise, suitable for B.Tech, M.Tech students of Computer Science, IT, etc This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Hardcover. Condición: new. Hardcover. The Book overing finite automata, regular languages, grammars, context-free languages, pushdown automata, Turing machines, decidability, recursive functions, and complexity theory.Clear explanations supported by diagrams and step-by-step derivationsWorked examples to strengthen conceptual understandingSolved and unsolved exercises for practiceSummary sections for quick revision.Theory of Computation of Formal Languages and Automata Theory included variety of examples solved, exercise, suitable for B.Tech, M.Tech students of Computer Science, IT, etc This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…