| 1 |
PPT0_Course Intro.pptx |
View
|
| 2 |
PPT10.0_RegularLanguageProperties.pptx |
View
|
| 3 |
PPT10.1_Decidable properties of RL.pptx |
View
|
| 4 |
PPT11_RE to FA.pptx |
View
|
| 5 |
PPT12_RE Identities and Ardens Theorem.pptx |
View
|
| 6 |
PPT13_State elimination method.pptx |
View
|
| 7 |
PPT14_Pumping Lemma.pptx |
View
|
| 8 |
PPT15_REGULAR GRAMMAR.ppt |
View
|
| 9 |
PPT16_FA to RG.pptx |
View
|
| 10 |
PPT17_PUSH DOWN AUTOMATA.ppt |
View
|
| 11 |
PPT18_CGF and CFL.ppt |
View
|
| 12 |
PPT19_CNF and GNF.pptx |
View
|
| 13 |
PPT1_Introduction of Automata Theory and Computability.pptx |
View
|
| 14 |
PPT20_CSG and RE.pptx |
View
|
| 15 |
PPT21_TURING MACHINES.ppt |
View
|
| 16 |
PPT22_complexity.pdf |
View
|
| 17 |
PPT2_Introduction to DFA.pptx |
View
|
| 18 |
PPT3_NFA.pptx |
View
|
| 19 |
PPT5_NFA-Conversion.pptx |
View
|
| 20 |
PPT6_Minimization of DFA.pptx |
View
|
| 21 |
PPT7_Moore and Mealy.pptx |
View
|
| 22 |
PPT8_Moore, Mealy Conversions.pptx |
View
|
| 23 |
PPT9_Regular Expression.pptx |
View
|