top of page
cslogo_11zon (1).jpeg

THEORY OF COMPUTATION

Construct DFA which accepts all the strings over an alphabet Σ = { a , b } len lessthan or equal - 2
05:47
All JNTU's || What is Epsilon Moves || PART II || FLAT || TOC || ACTD || Er. Y V D Chandra Sekhar
04:59
Construct DFA which accepts all the strings over an alphabet Σ = { a , b } len grater or equal - 2
07:34
Construct DFA which accepts all the strings over an alphabet Σ = { 0 , 1 } substring with '00'
09:09
All JNTU's || What is NFA || FLAT || TOC || ACTD || Er. Y V D Chandra Sekhar
23:19
All JNTU's || What is Epsilon Moves || PART I || FLAT || TOC || ACTD || Er. Y V D Chandra Sekhar
08:01
Construct DFA which accepts all the strings over an alphabet Σ = { 0 , 1 } substring with '0'
07:53
All JNTU's || DFA versus NFA || FLAT || TOC || ACTD || Er. Y V D Chandra Sekhar
07:05
bottom of page