adplus-dvertising
frame-decoration

Question

According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’;
Statement 2: FϵQ

a.

Statement 1 is true, Statement 2 is false

b.

Statement 1 is false, Statement 2 is true

c.

Statement 1 is false, Statement 2 may be true

d.

Statement 1 may be true, Statement 2 is false

Answer: (b).Statement 1 is false, Statement 2 is true

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F} Statement 1: q ϵ Q’; Statement 2: FϵQ

Similar Questions

Discover Related MCQs

Q. δˆ tells us the best:

Q. Which of the following option is correct?
A= {{abc, aaba}. {ε, a, bb}}

Q. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?

Q. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}

L2= {xϵ ∑*|x contains odd no’s of 1’s}

Nunber of final states in Language L1 U L2?

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

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

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

Q. There are ________ tuples in finite state machine.

Q. Transition function maps.

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

Q. Extended transition function is .

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

Q. String X is accepted by finite automata if .

Q. Languages of a automata is

Q. Language of finite automata is.

Q. Finite automata requires minimum _______ number of stacks.

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

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

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

Q. The basic limitation of finite automata is that