Theory Of Computation | Assignment – Nondeterminism and Kleene’s Theorem

MCA Semester – II

Subject: 620007 – Theory of Computation

Assignment – 9

Nondeterminism and Kleene’s Theorem

1	Nondeterministic Finite Automata
2	Non-Recursive Definition of δ* for an NFA
3	Recursive Definition of  δ* for an NFA
4	Acceptance by an NFA
5	NFA with Λ – Transition (NFA–Λ)
6	Non-Recursive Definition of δ* for an NFA – Λ
7	Λ – Closure of a Set of States
8	Recursive Definition of  δ* for an NFA – Λ
9	Statement & Application of Kleene’s Theorem - I
10	Statement & Application of Kleene’s Theorem - II
11	Relationship Between DFA and NFA
12	DFA Vs. NFA

Note: Write all Answers with Example.