Theory of Automata (V-U)

• Introduction to Languages and Computer Theory (V-U)
• Kleene’s Star Closure (V-U)
• Regular Expression (V-U)
• Equivalent Regular Expressions (V-U)
• Finite Automaton. (V-U)
• Equivalent FAs (V-U)
• FA corresponding to finite languages (V-U)
• Transition Graph (V-U)
• Generalized Transition Graphs (V-U)
• Kleene’s Theorem Part II (V-U)
• Kleene’s Theorem Part III (V-U)
• Kleene’s Theorem Part IV (V-U)
• Kleene’s Theorem Part V (V-U)
• Nondeterministic Finite Automaton (V-U)
• NFA with Null String (V-U)
• NFA and Kleene’s Theorem (V-U)
• NFA corresponding to Concatenation (V-U)
• Distinguishable strings and Indistinguishable strings (V-U)
• Moore machine (V-U)
• Mealy machine (V-U)
• Equivalent machines (V-U)
• Finite Automata with Output (V-U)
• Regular languages and Complement of a language (V-U)
• Nonregular languages (V-U)
• Pumping Lemma (V-U)