My Youtube Video Channel ( With Theory of Computations)


Sunday, January 5, 2014

Find Language Accepted by NFA

Before few days my friend Satish Prajapati asked me following question.

The Answer will be :- A
Because this is NFA with Empty String
when you convert it in to NFA, 
All states will become Final state because after processing "a" you will be reach to final state then after without any input (means using empty string) you can reach to all other states
means all string which can be created by L={a} are accepted by given NFA
so complement will be Phi
You can write your logic and answer in comment.
"Keep Breathing, Keep Learning, Keep Sharing"

Monday, January 28, 2013

Theory of Computations - MCQs

(1) The Context Free Languages are closed for:
(i) Intersection  (ii) Union  (iii) Complementations  (iv) Kleene Star 
(A) (i) and (iv)
(B) (i) and (iii)
(C) (ii) and (iv)
(D) (ii) and (iii)

(2)  ________ Method is known as Subset Construction Method.
(A) NFA to DFA Conversion
(B) NFA - ^ to NFA
(C) DFA Minimization
(D) None of Above

(3) Regular Expression a + b denotes the set :
(A) { a }
(B) { ^ , a , b}
(C) { a , b}
(D) None of these

(4) A Language represented by a non-deterministic finite state automaton is:
(A) Context Free Language
(B) Context Sensitive Language
(C) Regular Language
(D) Natural Language