1 Crore+ students have signed up on EduRev. Have you? 
Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing “m” words, each of length ‘n’
Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.
Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
Which of the following pairs of regular expressions are equivalent?
Explanation:
Rule (pq)*p=p (qp)*
Therefore–(xx*) (x*x**)
(xx*)(x*x*) [Using x**=x] (xx*)(x*) [Using x*x*=x*] (xx*) [Using x*xx*=x*)
x+
Let L denotes the language generated by the grammar S >0S0/00. Which of the following is true?
Explanation: The grammar itself is not regular but language L is regular as L can be represented using a regular grammar, for example S > S00/00.
Which of the following are not regular?
Explanation: Strings of odd number of zeroes can be generated by the regular expression (00) *0.Pumping lemma can be used to prove the nonregularity of the other options.
If ∑ = {a, b, c, d, e, f} then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is
Explanation: Here string length is 4 so we create string of length 4 by 6 values firstly we arrange any value by 6 methods. Then Remaining numbers are 5 so we can arrange them by 5 methods then remaining numbers are 4 so we arrange them by 4 methods and then 3.Thus 6*5*4*3=360.
Which one of the following statement is FALSE?
Explanation: CFL is closed under Kleene closure, concatenation, and Union
Which of the following strings is not generated by the following grammar?S → SaSbSε
Explanation:
S>aSbS putting S> € and then S>SaSbS
S>aSaSaSbSbSbS putting S>SaSbS
S>aaabbb putting S>€.
Regular expressions can be used only for values of type string and number.
Explanation: RE is used for all types of string and numbers.
What is the Regular Expression Matching Zero or More Specific Characters
Explanation: Zero or Specific Expression matching can be done only by a single character that is*
All __________ are automatically treated as regular expressions.
Explanation: It is seen that programmatic description are treated as regular expression.
The production Grammar is {S>aSbb,S>abb} is
Explanation: As per the definition of type2 grammar.
16 videos44 docs29 tests

Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 
16 videos44 docs29 tests









