CA Practice Mcq:
FINITE AUTOMATA : The Equivalence of Deterministic and Non-deterministic Finite Automata, Definition and Description of a Finite Automaton, Deterministic and Non-deterministic Finite State Machines, Acceptability of a String by a Finite Automaton, Mealy and Moore Machines, Minimization of Finite Automata, Basics of Strings and Alphabets, Transition Graph and Properties of Transition Functions, Regular Languages
REGULAR EXPRESSIONS AND REGULAR SETS : Regular Expressions and Identities for Regular Expressions, Finite Automata and Regular Expressions: Transition System Containing null moves, NDFA with null moves and Regular Expressions, Conversion of Non-deterministic Systems to Deterministic Systems, Algebraic Methods using Arden's Theorem, Construction of Finite Automata Equivalent to a Regular Expression, Equivalence of Two Finite Automata and Two Regular Expressions, Closure Properties of Regular Sets, Pumping Lemma for Regular Sets and its Application, Equivalence between regular languages: Construction of Finite Automata Equivalent to a Regular Expression, Properties of Regular Languages, Non-deterministic Finite Automata with Null Moves and Regular Expressions, Myhill-Nerode Theorem
Comments
Post a Comment