Все публикации

0:24:28

State Elimination problem - Example3 Converting Finite Automata into Regular Expression.

0:16:38

State Elimination problem - Example2 Converting Finite Automata into Regular Expression.

0:19:29

State Elimination problem - Example1 Converting Finite Automata into Regular Expression.

0:04:25

State Elimination Technique - Rules(Converting Finite Automata into Regular Expression)

0:04:58

Recursive and Recursively Enumerable Languages in Turing Machine

0:07:01

Properties of Recursive Languages

0:11:41

Designing of an Universal Turing Machine(UTM)

0:11:24

Pumping Lemma on CFL for L = {a^nb^nc^n } where n is greater than or equal to zero is not CFL

0:15:49

Design a Turing Machine to reverse a given string f(w)=w^R

0:08:30

Design a Turing Machine that replaces all occurrences of 111 by 101 from sequences of 0's and 1's

0:23:22

Design a Turing Machine for Even and Odd length palindrome

0:25:36

Design a Turing Machine that can compute proper subtraction that is m-n

0:13:52

Design a Turing Machine for the addition operation f(m,n)=m+n

0:15:16

Construction of Turing Machine for the language L = {0^n1^n}

0:29:03

Convert the given Push Down Automata into Context Free Grammar - Clear Solution.

0:24:55

Construct a Push Down Automata for the language L={a^3nb^n}

0:26:43

Converting Context Free Grammar into GNF Rules and Clear Example Problem.

0:07:53

Convert the given context free grammar into push down automata

0:24:17

Construct a Deterministic Push Down Automata(DPDA) for Palindrome or L={wcw^R / w =(0,1)*}

0:24:55

Construct a Push Down Automata for the language L= {a^3n b^n} where n is greater than or equal to 1.

0:21:49

Convert the given grammar(CFG) into CNF .

0:13:22

Construct a Push Down Automata for the language L= {0^n 1^n} n greater than or equal to 1.

0:24:29

Conversion of Finite Automata into Regular Expression

0:07:29

Pumping Lemma For Regular Language