Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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.
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.
For a _________ state DFA, the time taken for DFA-NFA conversion is O(n).
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
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?
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?
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?
The table below presents the data of seats won by leading political parties in 6 states. Study the given information and answer the questions that follow. Seats won by different political parties in different states Political Parties Stats State A State B State C State D State E State F Cock 12 21 3 2 4 19 Eagle 4 3 23 2 1 13 Bat 1 21 6 1 18 5 OwI 2 1 11 .0 9 14 Parrot 15 7 3 0 6 0 Swan 18 2 6 4 2 0 In which state were elections held for the maximum number of seats compared to the other states?
Let be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?