Given:L1= {xϵ ∑*|x contains even no’s of 0’s}L2= {xϵ ∑*|x c – McqOptions

MCQOPTIONS

1.	Given:L1= {xϵ ∑\|x contains even no’s of 0’s}L2= {xϵ ∑\|x contains odd no’s of 1’s}No of final states in Language L1 U L2?
A.	1
B.	2
C.	3
D.	4
Answer» D. 4

Discussion

No Comment Found

Related MCQs

The sum of minimum and maximum number of final states for a DFA n states is equal to:
The maximum sum of in degree and out degree over a state in a DFA can be determined as:∑= {a, b, c, d}
The maximum number of transition which can be performed over a state in a DFA?∑= {a, b, c}
Given:L1= {xϵ ∑*|x contains even no’s of 0’s}L2= {xϵ ∑*|x contains odd no’s of 1’s}No of final states in Language L1 U L2?
Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})?
Which of the following option is correct?A= {{abc, aaba}. {ε, a, bb}}
δˆ tells us the best:
According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}Statement 1: q ϵ Q’; Statement 2: FϵQ
The_sum_of_minimum_and_maximum_number_of_final_states_for_a_DFA_n_states_is_equal_to:$
The maximum number of transition which can be performed over a state in a DFA?