Provisional
Syllabus for Theoretical Computer Science
Please
write suggestions as comment below….
1. Languages
2. Grammars
3. Automata
4. Deterministic Finite
Accepters
5. Regular Languages
6. Nondeterministic Finite Accepters
7. Reduction in Number of States
in Finite Automata
8. Regular Expressions
9. Regular Grammars
10. Closure Properties of Regular Languages
11. Pumping Lemma for Regular Languages
12. Context Free Grammars (CFG)
13. Leftmost and Rightmost Derivation
14. Parsing and Ambiguity
15. Simplification of CFG
16. Normal Forms
1. CNF
2. GNF
17. Pushdown Automata
18. Nondeterministic Pushdown Automata
19. Deterministic Pushdown Automata
20. Pumping Lemma for CFG
21. Closure Properties of CFG
22. Turing Machine
23. Recursive Languages
24. Recursively Enumerable Languages
25. Context Sensitive Grammars
26. Linear Bounded Automata
27. Chomsky Hierarchy
28. Complexity Classes P and NP
29. Polynomial Reduction
30. NP Completeness
these r very imp. topics plz give more about these topics means give detail info. about all these topics
ReplyDeletewhen these topics avilable?? waiting 4 dat..
ReplyDeletePlease give the notes fastly as soon as possible for compiler design, Fuzzy logic and discrete mathemetical terms like Automata topics. really your notes are very useful to me. great service. Thank you for this help
ReplyDeletepls TOC pdha do sir
ReplyDelete