DFA for binary string divisible by 2, 3 and 4

Turing Machine for a ^ib^jc^k s.t. a is greater than b and b is greater than c

Basics of Automata

Minimized DFA for (01)+/(010)+

DFA for binary string divisible by 2, 3 and 4

Constructing NFA Using Thompson's Construction Ex 2

DFA for at least 3 a's and at least 2 b's

NFA with epsilon to NFA without epsilon Ex. 2

NFA with Epsilon to NFA without Epsilon Ex.1

NFA to DFA to RE

Regular Expression to DFA

RE to DFA using Thompson's and Subset Construction Ex. 2

DFA Minimization using Myhill Nerode Theorem Ex. II

PDA Ex. 2 (Method II)

DFA for string not having substring 101

PDA Ex. 1 (Method II)

PDA Method II

DFA for Even Number of 'a' and 'b'

DFA for Binary number divisible by 5

Push Down Automata Ex. 3 (Method 1)

Turing Machine for EQUAL ( Turing Machine for Equal number of a and b), TM for EQUAL

TM for palindrome

Turing Machine for a^nb^2n

TM fo a^nb^nc^n

Push down Automata Examples Ex. 1 (Method 1)