Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

A signal is said to be 1. Deterministic if there is no uncertainty over the signal at any instant of time. 2. Deterministic if it is expressible through a mathematical equation. 3. Random or non-deterministic if there is uncertainty over the signal at the instant of time. 4. Random or non-deterministic if it is not expressible through a mathematical equation. Which of the above statements are correct?
A deterministic finite automaton (DFA) D with alphabet ∑ = {a,b} is given below. Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?
How many states are there in a minimum state deterministic finite automaton accepting the language L = {w | ∈ (0,1)*, number of 0's is divisible by 2, and number of 1's is divisible by 5, respectively}?
Consider two database relations R and S having 3 tuples in R and 2 tuples in S. what is the maximum number of tuples that could appear in the natural join of R and S?
Consider the following Deterministic Finite Automaton M. Let S denote the set of eight-bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is
Consider the following deterministic finite state automaton M. S denotes the set of seven bit in which the 1st ,4th and last bits are 1. The number of strings that are accepted by M is
Which one of the following provides the ability to query information from the database and to insert tuples into, delete tuples from, and modify tuples in the database?
For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.