If L1 and L2 are regular sets then intersection of these two will be
Complement of regular sets are _________
Regular sets are closed under union,concatenation and kleene closure.
A finite automaton accepts which type of language:
NFA, in its name has ’non-deterministic’ because of :
If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is?
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|=?
An automaton that presents output based on previous state or current input:
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.
When are 2 finite states equivalent?
Which of the following is not a step in elimination of states procedure?
If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken?
Which of the following is an utility of state elimination phenomenon?
Complement of a DFA can be obtained by
Which of the following can accept even palindrome over {a,b}
