Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.

Let L be a language whose FA consist of 5 acceptance states and 11 non

1.	Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in L^c.
A.	16
B.	11
C.	5
D.	6
Answer» B. 11

Discussion

No Comment Found

Related MCQs

There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the maximum number of states in its equivalent DFA?
Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which among the following is true?a) Q’ = P(Q)b) Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r,
Which of the following options is correct for the given statement?Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2k.
Statement 1: NFA computes the string along parallel paths.Statement 2: An input can be accepted at more than one place in an NFA.Which among the following options are most appropriate?
Predict the analogous operation for the given language:A: {[p, q] | p ϵ A1, q does not belong to A2}
Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.
Given Language: {x | it is divisible by 3}The total number of final states to be assumed in order to pass the number constituting {0, 1} is
LET_N_(Q,_‚ÄÖ√Ñ√∂‚ÀÖ‚Ä†‚ÀÖ¬¥,_‚ÂÀ√≠¬¨‚Ä¢,_Q0,_A)_BE_THE_NFA_RECOGNIZING_A_LANGUAGE_L._THEN_FOR_A_DFA_(Q‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•,_‚ÄÖ√Ñ√∂‚ÀÖ‚Ä†‚ÀÖ¬¥,_‚ÂÀ√≠¬¨‚Ä¢‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•,_Q0‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•,_A‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•),_WHICH_AMONG_THE_FOLLOWING_IS_TRUE??$#
There_exists_an_initial_state,_17_transition_states,_7_final_states_and_one_dumping_state,_Predict_the_maximum_number_of_states_in_its_equivalent_DFA?$
Which of the following options is correct for the given statement?

Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.

Discussion

No Comment Found

Related MCQs

Reply to Comment

Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in L^c.