Have an account?
Skip to Content
Build your own quiz
Suggestions for you
15 questions
Show Answers
See Preview
- 1. Multiple Choice
δ(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
- 2. Multiple Choice
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
- 3. Multiple Choice
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
- 4. Multiple Choice
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
- 5. Multiple ChoiceThis caused to change states of the automaton.AlphabetInputStart StateFinal State
- 6. Multiple Choice
A DFA can be represented in the following format
Tree
Transition table
C Code
None of the mentioned
- 7. Multiple Choice
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
- 8. Multiple Choice
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
- 9. Multiple Choice
A finite automata recognizes
Any Language
Context Sensitive Language
Context Free Language
Regular Language
- 10. Multiple Choice
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
- 11. Multiple Choice
∑ is _________?
set of input symbols
set of output symbols
set of states
transitions
- 12. Multiple Choice
Non-empty finite set of states is represented by _______
∑
Q
F
q0
- 13. Multiple Choice
δ represents_______?
transition diagram
transition function
transition table
empty string
- 14. Multiple Choice
F represents________?
set of final states
final state
states
transitions
- 15. Multiple Choice
A NFA state may partially determine the next state.
True
False
- Answer choicesTagsAnswer choicesTags