Posts

Showing posts from April 25, 2010

Assignment – 9 Nondeterminism and Kleene’s Theorem

B. H. Gardi College of Engineering and Technology,Rajkot Department of MCA MCA Semester – II Subject: 620007 – Theory of Computation Assignment – 9 Nondeterminism and Kleene’s Theorem
Date: 29-Apr-2010

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.

Solved Exercises John C. Martin

Image
Chapter - 1 Basic Mathematical Objects Solution

Chapter - 2 Mathematical Induction and Recursive Definitions Solution

Chapter - 3 Regular Expressions and Finite Automata Solution

Chapter - 4 Nondeterminism and Kleene's Theorem Solution

Chapter - 5 Regular and Nonregular Languages Solution

Chapter - 6 Context Free Grammars Solution

Chapter - 7 Pushdown Automata Solution

Chapter - 8 Context Free and Non-Context Free Languages Solution

Chapter - 9 Turing Machine Solution 

Chapter - 10 Recursively Enumerable Languages Solution





Give your valuable feedback about Blog & Get e-copy of solution
http://theoryofcomputations.blogspot.in/p/feedback.html