Theory of Computation: A Simplified Foundational Approach to Automata, Languages, and Computability
Uitgelicht
|
20,14 |
Naar shop
|
|
20,14 |
Naar shop
|
|
22,00 |
Naar shop
|
Beschrijving
Bol
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
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
AmazonPagina's: 426, Paperback, Notion Press
Prijshistorie
* Prijshistorie bevat geen data van Amazon, Amazon Marketplace.
Prijzen voor het laatst bijgewerkt op: