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

Q. An automaton that presents output based on previous state or current input:

View solution

Q. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?

View solution

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

View solution

Q. Which of the following is correct proposition?
Statement 1: Non determinism is a generalization of Determinism.

Statement 2: Every DFA is automatically an NFA

View solution

Q. Given Language L= {xϵ {a, b}*|x contains aba as its substring}
Find the difference of transitions made in constructing a DFA and an equivalent NFA?

View solution

Q. The construction time for DFA from an equivalent NFA (m number of node)is:

View solution