| Q. |
The basic limitation of finite automata is that
A.
It can not remember arbitrary large amount of information
B.
It sometimes recognize grammar that are not regular
C.
It sometimes fails to recognize regular grammar
Answer :
It can not remember arbitrary large amount of information
Show Answer
|
| Q. |
How many DFA exits with two states over input alphabet {0,1} ?
Show Answer
|
| Q. |
Regular expression for all strings starts with ab and ends with bba is.
D.
All of the mentioned 9.
Show Answer
|
| Q. |
Number of final state require to accept Φ in minimal finite automata.
Answer :
None of the mentioned
Show Answer
|
| Q. |
Finite automata requires minimum _______ number of stacks.
Show Answer
|
| Q. |
Language of finite automata is
Show Answer
|
| Q. |
Languages of a automata is
A.
If it is accepted by automata
C.
If automata touch final state in its life time
D.
All language are language of automata
Answer :
If it is accepted by automata
Show Answer
|
| Q. |
Number of states require to accept string ends with 10
Show Answer
|
| Q. |
There are ________ tuples in finite state machine
Show Answer
|
