theory of computation mit

Theory Of Computation 58,Conversion of epsilon NFA to NFA

8:06

Theory Of Computation 28,DFA which accepts strings=a^nb^mc^l/n,m,l greater than equal to 0}

1:24

$Theory Of Computation 25,DFA which accepts strings={ a^nb^m | n,m greater than or equal to 0}$

3:01

Theory Of Computation 50,Examples of Moore machine

6:09

Theory Of Computation 43,Minimization of DFA

3:39

Theory Of Computation 41,Minimization of DFA

17:20

Theory Of Computation 40,Complementation of NFA

9:18

Theory Of Computation 38, convertion of NFA to DFA

7:48

Theory Of Computation 37 , convertion of NFA to DFA

13:16

Theory Of Computation 36,Conversion of NFA to DFA

5:24

Theory Of Computation 35,Conversion of NFA to DFA

5:32

Theory Of Computation 32, Problems of DFA

4:02

Theory Of Computation 30,DFA which accepts strings of form a^3bwa^3 , where 'w' is any string

8:20

Theory Of Computation 29,DFA which accepts strings such that 2nd symbol from LHS is 'a'

4:22

Theory Of Computation 12,Comparison between different DFAs

3:23

Theory Of Computation 11,DFA of strings which ends with 'a'

3:53

$Theory Of Computation 27,DFA which accepts strings={ a^nb^mc^l/n,m,l greater than equal to 0}$

4:27

$Theory Of Computation 26,DFA which accepts strings={ a^nb^m c^l| n,m,l greater than or equal to1}$

4:59

$Theory Of Computation 24,DFA which accepts strings= { a^nb^m | n,m greater than or equal to 1}$

3:37

Theory Of Computation 8,DFA of binary no divisible by 4

12:19

Theory Of Computation 7,DFA of binary no which is divisible by 3

8:21

Theory Of Computation 6, DFA construction of binary no which is divisible by 2 and number system

16:17

Theory Of Computation 5,DFA construction

7:25

Theory Of Computation 57, Epsilon NFA and conversion of epsilon NFA to NFA

17:36

Theory Of Computation 47,Examples of Moore machine

5:20

Theory Of Computation 45,Minimization of DFA

4:40

Theory Of Computation 44,Minimization of DFA

4:03

Theory Of Computation 42,Minimization of DFA

15:10

Theory Of Computation 31, DFA Union,Concatenation, Cross product, Complementaion,Reversal

24:24

Theory Of Computation 23,DFA which accepts strings in which every 'a' is never be followed by 'bb'

4:05

Theory Of Computation 22,DFA which accepts strings in which every 'a'

5:15

Theory Of Computation 21,DFA which accepts strings in which every 'a' is never be followed by 'b'

3:31

Theory Of Computation 20,DFA which accepts strings in which every 'a' is followed by 'b'

3:49

Theory Of Computation 19,Complementation of DFA

7:37

Theory Of Computation 17,DFA which accepts string staring and ending with different sysmbol

5:58

Theory Of Computation 16,DFA problem and concatenation of DFA

5:44

Theory Of Computation 15, DFA of strings which ends with 'ab'

4:10

Theory Of Computation 14, DFA of strings containing 'ab' as substring

4:22

Theory Of Computation 4, DFA and problem

8:51

Theory Of Computation 39,Examples to construct NFA

3:35