Automata assignment-1 (CS 4A)

Make an assignment which include all topic which we have covered in class. Atleast on question for every topic.

Topics:

• Strings and Languages
• Grammar
• Deterministic finite Automata (DFA)
• Language of DFA
• Non-deterministic finite Automata (NFA)
• NFA with epsilon transition
• Equivalence of NFA and DFA
• Minimization of Finite Automata
• Distinguishing one string from other
• Algebraic laws for Regular expressions
• Kleen’s Theorem
• Regular expression to FA
• DFA to Regular expression
• Arden Theorem- convert NFA to regular expression
• Moore and Mealy machine
• Equivalence of Moore and Mealy Machine