Cs402 short lecture 6 (String having double 0’s or double 1’s, containing triple a’s or triple b’s )
Similar Tracks
Cs402 short lecture 7 ( A corresponding to finite languages(using both methods), Transition graphs)
Super World
Cs402 short lecture 8 (Example of TG: accepting all strings, none, starting with b, not ending in b)
Super World
Cs402 short lecture 12 (Kleene’s theorem part III(method 1:union of FAs), FAs corresponding to REs)
Super World
CS402 short lecture 16 ( NFA with null string, example, converting NFA to FA (method 1,2,3) example)
Super World
Cs402 short lecture 5 (Different notations of transition diagrams, languages of even/odd length, )
Super World
Cs402 short lecture 9 (TGs accepting the languages: containing aaa or bbb, Definition of GTG)
Super World