Finite Automata
5
There are ________ tuples in finite state machine.
None of the mentioned
Number of final state require to accept Φ in minimal finite automata.
64
How many DFA’s exits with two states over input alphabet {0,1} ?
True
FSM with output capability can be used to add two given integer in binary representation.
6
Melay and Moore machines are collection of _______ tuples.
Q * Σ* -> Q
Extended transition function is .
0
Finite automata requires minimum _______ number of stacks.
True
The basic limitation of finite automata is that it can’t remember arbitrary large amount of information.
Present input symbol and present state
In Mealy machine o/p depends on_______________
Non Deterministic Finite Automata
NDFA Stands for____________________________
δ*(Q0,x) E A
String X is accepted by finite automata if .
ab(a+b)*bba
Regular expression for all strings starts with ab and ends with bba is_____________.
2^(3*8)
Number of states require to simulate a computer with memory capable of storing ’3′ words each of length ’8′.
current input symbol and current state
In Moore machine the next state is decided by_______________
R U S
Let r and s are regular expressions denoting the languages R and S. Then (rs)denote