|
|
| Book details / order |
| AUTOMATA AND THEORETICAL COMPUTER SCIENCE |
Automata and theoretical computer science is written in a simple, easy-to-understand manner making the subject exciting and accessible to the students of engineering. this text does not assume a prior knowledge of the subject and maintains a balance between fundamentals and rigorous mathematical treatment of the subject.
introduction.
regular expressions and finite automata.
nfa and dfa equivalence.
closure of regular languages.
context free languages and grammars.
pumping lemma.
turing machine.
Author : B. r. ragade
Publication : Pearson
Isbn : 9788129702043
Store book number : 107
NRS 152.00
|
 |
|
|
|
|
|
|
|
| |
|
|
