COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
{aibi|i>=0}
|
|
|
{aibi|0<i<5}
|
|
|
{aibi|i>=1}
|
|
|
None of the mentioned
|
Detailed explanation-1: -Which of the following is a regular language? a)String whose length is a sequence of prime numbersb)String with substring wwrin betweenc)Palindrome stringd)String with even number of Zero’sCorrect answer is option ‘D’.
Detailed explanation-2: -Find out whether the language L = an | n ≥1 is regular or not. If we observe the given question clearly there is a pattern in the language and FA can also be generated for the given language. So, we can say the given language is a regular language.
Detailed explanation-3: -3. Which of the following language regular? Explanation: Here, i has limits i.e. the language is finite, contains few elements and can be graphed using a deterministic finite automata. Thus, it is regular.
Detailed explanation-4: -That is, a regular language, in general, corresponds to more than one regular expressions. For example ( a + b )* and ( a*b* )* correspond to the set of all strings over the alphabet a, b. Regular expressions are equal if and only if they correspond to the same language.