Note for Theory Of Computation - TC by Akash Sharma
- Theory Of Computation - TC
- Note
- 35 Topics
- 1955 Views
- 36 Offline Downloads
- Uploaded 11 months ago
Touch here to read
Page-1
Note for Theory Of Computation - TC by Akash Sharma
- Theory of Computation - ( 1 - 1 )
- Fundamental Model - ( 2 - 7 )
- Powers of Language - ( 8 - 14 )
- Machines - ( 15 - 18 )
- Regular Languages and Finite Automata - ( 19 - 19 )
- DFA and NFA Theory - ( 20 - 25 )
- DFA Design - ( 26 - 32 )
- Grid Machines - ( 33 - 39 )
- Regular Expression - ( 40 - 43 )
- Regular Expression to Language - ( 44 - 49 )
- Machine to Regular Theorem - ( 50 - 56 )
- Arden's Theorem - ( 57 - 57 )
- Regular Grammer - ( 58 - 67 )
- Facts - ( 68 - 80 )
- String Equivalence - ( 81 - 84 )
- Usage of Closure Table - ( 85 - 94 )
- GFL'S and PDA - ( 95 - 97 )
- Pal in Drome - ( 98 - 98 )
- CFL - ( 99 - 99 )
- Parsing and Ambiguity - ( 100 - 101 )
- Chomsky Normal Form - ( 102 - 108 )
- Algorithims - ( 109 - 109 )
- Removal of unit Production - ( 110 - 110 )
- Removal of Useless Production - ( 111 - 111 )
- Removal of Left Recwsion - ( 112 - 112 )
- Removal of Left Factoring - ( 113 - 113 )
- Removal of GNF - ( 114 - 114 )
- PDA programming - ( 115 - 120 )
- Palindrome - ( 121 - 123 )
- Closure Properties - ( 124 - 133 )
- Variations of Turing Machine - ( 134 - 137 )
- Less power than STM - ( 138 - 139 )
- REC and RE - ( 140 - 146 )
- Decidability - ( 147 - 148 )
- complexity - ( 149 - 153 )
Topic:
Leave your Comments