Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following statement(s) is/are TRUE? (i) For every NFA with an arbitrary number of final states, there is an equivalent NFA with only one final state. (ii) A language that is accepted by a DFA will also be accepted by some NFA.
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.
If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?
All the regular languages can have one or more of the following descriptions: i) DFA ii) NFA iii) e-NFA iv) Regular Expressions Which of the following are correct?
For an automata, which of the following are equivalent variants? DFA,NFA and NFA with epsilon transitions
For a _________ state DFA, the time taken for DFA-NFA conversion is O(n).
The behaviour of NFA can be simulated using DFA.
Conversion of a DFA to an NFA __________
Consider the following two statements: I. If all states of an NFA are accepting states then the language accepted by the NFA is ∑*. II. There exists a regular language A such that for all languages B, A ∩ B is regular. Which one of the following is CORRECT?
NFA-εs are defined because certain properties can be more easily proved on them as compared to NFA.