18:59

JNNCE CSE ATC SNN M5 C2

25:57

Reducing non determinism JNNCE CSE ATC SNN M3 C14

20:46

REDUCING NON DETERMINISM IN PDA JNNCE CSE ATC SNN M3 C13

44:31

Non Deterministic push Down Automata JNNCE CSE ATC SNN M3-C12

34:30

JNNCE CSE SE SNN M5 C5

39:37

TURING MACHINES JNNCE CSE ATC SNN M4 C2

25:14

DECIDABILITYJNNCE CSE ATC SNN M5 C1

37:16

POST CORRESPONDANCE PROBLEM JNNCE CSE ATC SNN M5 C3

18:08

CONVERT TO BNF JNNCE CSE ATC SNN M4 EC2

41:44

DESIGN DFSM_JNNCE CSE ATC SNN M1-C5

32:28

CONVERT TO BNF-2 JNNCE CSE ATC SNN M4 EC3

37:50

design of turing machines JNNCE CSE ATC SNN M4 C4

29:07

design of turning machines JNNCE CSE SNN ATC M4 C5

23:50

TURNING MACINES-2 JNNCE CSE ATC SNN M4 C3

34:31

DESIGN OF TURING MACHINES JNNCE CSE ATC SNN M4 C6

24:39

TECHNIQUES OF TURING MACHINE CONSTRUCTION JNNCE CSE ATC SNN M4 C7

19:09

TECHNIQUES OF TURING MACHINE CONSTRUCTION- SUBROUTINE-MULTIPLICATION EXAMPLE JNNCE CSE ATC SNN M4 C8

31:05

VARIANTS OF TURING MACHINES JNNCE CSE ATC SNN M4 C9

12:45

LINEAR BOUNDED AUTOMATA JNNCE CSE ATC SNN M4 C10

25:41

CONVERSION CFG TO PDF JNNCE CSE ATC SNN M4 EC1

43:13

PROBLEMS ON Push Down Automata JNNCE CSE ATC SNN M3 C11

41:24

PUSH DOWN AUTOMATA JNNCE CSE ATC SNN M3 C10

30:05

CONVERSION TO CNF JNNCE CSE ATC SNN M3 C9

43:28

NORMAL FORMS JNNCE CSE ATC M3 C8 U

24:16

AMBIGUITY JNNCE CSE ATC SNN M3 C7 U

28:31

Removing Ambiguity from Grammar JNNCE CSE ATC SNN M3 C6

34:56

PARSE TREE, REMOVE EPSILON PRODUCTIONS JNNCE CSE ATC SNN M3 C5

31:02

SIMPLIFY GRAMMAR-2 JNNCE CSE SNN ATC M3 C4

30:26

Designing CFG JNNCE CSE ATC SNN M3 C2

35:31

SIMPLIFY GRAMMAR-CLASS 1 JNNCE CSE ATC SNN M3 C3

34:27

Rewrite Systems, Context free Grammers_VTU_JNNCE CSE ATC SNN M3 C1

49:47

Problems to show the language is not regular_VTU_JNNCE CSE ATC SNN M2 C10

15:27

Pumping Lemma,Pigeon hole principle_VTU_JNNCE CSE ATC SNN M2 C9

41:45

Regular and Non RegularLanguages_VTU_JNNCE CSE ATC SNN M2 C8

43:53

CONVERT REGULAR GRAMMARS TO FSM_VTU_JNNCE CSE ATC SNN M2 C7

40:44

SIMPLIFYING REGULAR EXPRESSIONS_VTU_JNNCE CSE ATC SNN M2 C6

33:46

Applications of regular expressions_VTU_JNNCE CSE ATC SNN M2 C5

28:22

Building FSM from RE_VTU_JNNCE CSE ATC SNN M2 C4

37:17

BUILDING FSM FROM RE_VTU_JNNCE CSE ATC SNN M2 C3

29:31

bidirectional transducers, regular expressions_VTU_JNNCE-CSE-ATC-SNN-M1-C12

23:06

LANGUAGE HIERARCHY, FSM, DFSM_VTU_JNNCE CSE ATC SNN M1 C3,C4

26:08

STRINGS AND LANGUAGES_VTU_JNNCE CSE ATC SNN M1 C2

29:08

WHY STUDY AUTOMATA, APPLICATIONS, ALPHABETS, STRINGS_VTU_JNNCE CSE ATC SNN M1 C1

44:00

REGULR EXPRESSIONS_VTU_JNNCE CSE ATC SNN M2 C2

29:19

bidirectional transducers, regular expressions_VTU_JNNCE CSE ATC CNN M2 C1

32:18

canonical form, transducers, mealy and moore machines_VTU_JNNCE CSE ATC SNN M1-C11

46:40

Simulators for FSM, minimizing dfsm_VTU_JNNCE CSE ATC SNN M1-C10

47:40

NDFSM to DFSM conversion- Example 2_VTU_JNNCE CSE ATC SNN M1-C9

31:50

Epsilon closure and NDFSM to DFSM conversion_VTU_JNNCE CSE ATC SNN M1-C8

29:05

NDFSM Design_VTU_JNNCE CSE ATC SNN M1-C7

39:08

DFSM DESIGN_VTU_JNNCE CSE ATC SNN M1-C6

37:16

JNNCE CSE ATC SNN M5 C3

33:24

JNNCE CSE ATC SNN M5 C4

24:43

JNNCE CSE ATC SNN MOD5 C5