Q. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}

View solution

Q. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}

View solution

Q. The sum of minimum and maximum number of final states for a DFA n states is equal to:

View solution

Q. There are ________ tuples in finite state machine.

View solution

Q. Transition function maps.

View solution

Q. Number of states require to accept string ends with 10.

View solution

Q. Extended transition function is .

View solution

Q. δ*(q,ya) is equivalent to .

View solution

Q. String X is accepted by finite automata if .

View solution

Q. Languages of a automata is

View solution

Q. Language of finite automata is.

View solution

Q. Finite automata requires minimum _______ number of stacks.

View solution

Q. Number of final state require to accept Φ in minimal finite automata.

View solution

Q. Regular expression for all strings starts with ab and ends with bba is.

View solution

Q. How many DFA’s exits with two states over input alphabet {0,1} ?

View solution

Q. The basic limitation of finite automata is that

View solution

Q. Number of states require to simulate a computer with memory capable of storing ‘3’ words each of length ‘8’.

View solution

Q. FSM with output capability can be used to add two given integer in binary representation. This is

View solution

Q. Which of the following options is correct?
Statement 1: Initial State of NFA is Initial State of DFA.

Statement 2: The final state of DFA will be every combination of final state of NFA.

View solution

Q. Given Language: L= {ab U aba}*
If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,

|X-Y|=?

View solution