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.
For an automata, which of the following are equivalent variants? DFA,NFA and NFA with epsilon transitions
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?
If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?
For a _________ state DFA, the time taken for DFA-NFA conversion is O(n).
According to Naiya̅yikas we ascertain the relation of universal concomitance between x and y :  (A) We can determine the relation only if we can determine the relation of essential identity between x and y   (B) By perceiving that in all cases the presence of x is accompanied by the presence of y  (C) We can determine the relation only if we can determine the relation of cause and effect between x and y  (D) By not perceiving any instance where the presence of x is not accompanied by the presence of y or vice-versa.  Choose the correct answer from the options given below : 
What is the relation between NFA-accepted languages and DFA accepted languages?
Which among the following type of relations are considered by Nya̅ya system as necessary relation between middle and major terms? (A) Species - species relation  (B) The causal relation  (C) Member - class relation  (D) Species - genus relation  Choose the correct answer from the options given below :
Computational learning theory analyzes the sample complexity and computational complexity of __________