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 derivations
Worked examples to strengthen conceptual understanding
Solved and unsolved exercises for practice
Summary 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
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9798903629794
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur L2-9798903629794
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : 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 multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9798903629794
Quantité disponible : 1 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur L2-9798903629794
Quantité disponible : Plus de 20 disponibles
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : 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. N° de réf. du vendeur 9798903629794
Quantité disponible : 1 disponible(s)
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Hardcover. Etat : 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9798903629794
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9798903629794
Quantité disponible : 2 disponible(s)