×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)*(0+1)(0+1)* is __________________ [Note that this question was originally asked as Fill-in-the-Blanks type]
2.
What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
3.
How many minimum states are required in a DFA to find whether a given binary string has odd number of 0's or not, there can be any number of 1's.
4.
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is ____________
5.
Let L denotes the language generated by the grammar S -> 0S0/00. Which of the following is true?
6.
The smallest finite automation which accepts the language {x | length of x is divisible by 3} has :
7.
Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least
8.
The regular expression 0*(10*)* denotes the same set as
9.
Let Nf and Np denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let Df and Dp denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata, respectively. Which one of the following is TRUE?
10.
Consider the automata given in previous question. The minimum state automaton equivalent to the above FSA has the following number of states