636 подписчиков
59 видео
RE to NFA with examples
Context Free Grammar , CFG
DFA for at least 3 a's and at least 2 b's
DFA for string not having substring 101
PDA Ex. 2 (Method II)
Examples of CFG Generation, Context Free Grammar
NFA with Epsilon to NFA without Epsilon Ex.1
Regular Expression to DFA
Turing Machine for EQUAL ( Turing Machine for Equal number of a and b), TM for EQUAL
Push down Automata Examples Ex. 1 (Method 1)
DFA for Even Number of 'a' and 'b'
TM fo a^nb^nc^n
TM for palindrome
NFA to DFA to RE
PDA Method II
Turing Machine for a^nb^2n
RE to DFA using Thompson's and Subset Construction Ex. 2
Basics of Automata
PDA Ex. 1 (Method II)
DFA for Binary number divisible by 5
Constructing NFA Using Thompson's Construction Ex 2
DFA Minimization using Myhill Nerode Theorem Ex. II
Minimized DFA for (01)+/(010)+
