1 Crore+ students have signed up on EduRev. Have you? Download the App 
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
A binary string is divisible by 4 if and only if it ends with:
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.
If L1 and L2 are regular languages, which among the following is an exception?
Predict the analogous operation for the given language:
A: {[p, q]  p ϵ A1, q does not belong to A2}
Which among the following NFA’s is correct corresponding to the given Language?
L= {xϵ {0, 1}  3rd bit from right is 0}
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?
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 2^{k}.
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?
18 videos56 docs44 tests

18 videos56 docs44 tests
