NFA Vs DFA

δ(A,1) = B

δ(A,0) =A

δ(B, 0) =C

δ(B,1)=C

δ(C,0) = A

(Initial state =A)

String=”011001” will be in which state?

• a) A

• b) C

• c) B

• d) Invalid String

Languages of a automata is

• If it is accepted by automata

• If it halts

• If automata touch final state in its life time

• All language are language of automata

The basic limitation of finite automata is that

• It can’t remember arbitrary amount of information.

• It sometimes recognize grammar that are not regular.

• It sometimes fails to recognize regular grammar.

• All of the mentioned

Finite automata's are not able to recognize L={equal number of a's and equal number of b's} over {a,b} because

• Finite automata can deterministically find the midpoint

• Not having any auxiliary memory

• Having auxiliary memory

• None

This caused to change states of the automaton.

• Alphabet
• Input
• Start State
• Final State

A DFA can be represented in the following format

• Tree

• Transition table

• C Code

• None of the mentioned

NFA, in its name has ’non-deterministic’ because of :

• The result is undetermined

• The choice of path is non-deterministic

• The input symbol to be transited next is deterministic

• All of the mentioned

A language is regular if and only if it is accepted by finite automata

• The given statement statement is true

• Given statement is false

• Statement is partially true

• None of the mentioned

A finite automata recognizes

• Any Language

• Context Sensitive Language

• Context Free Language

• Regular Language

According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}

Statement 1: q ϵ ∑;

Statement 2: FϵQ;

• Statement 1 is true, Statement 2 is false

• Statement 1 is false, Statement 2 is true

• Statement 1 is false, Statement 2 may be true

• Statement 1 may be true, Statement 2 is false