TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
16:19
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1 (STRINGS STARTS WITH) IN AUTOMATA THEORY || TOC
14:14
WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION
18:06
CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC
19:44
PUSHDOWN AUTOMATA EXAMPLE (a^n b^n) | PDA EXAMPLE | TOC
14:58
BASIC NOTATIONS & REPRESENTATIONS IN AUTOMATA THEORY || BASICS OF AUTOMATA || THEORY OF COMPUTATION
30:42
CHOMSKY NORMAL FORM (CNF) & CONVERSION OF CFG TO CNF IN AUTOMATA THEORY || CFG TO CNF || TOC
19:49
REGULAR GRAMMAR IN AUTOMATA THEORY || GRAMMAR || LEFT LINEAR GRAMMAR || RIGHT LINEAR GRAMMAR || TOC
15:41