Bissoy.com
Doctors Medicines MCQs Q&A

The given regular language corresponds to which of the given regular language e+1+(1+0)*0+(0+1)*11

The given regular language corresponds to which of the given regular language e+1+(1+0)*0+(0+1)*11 Correct Answer The language of all strings which does not end with 01

According to the given regular expression, e is accepted by its language and it does not end with 00 or 11 or 0 or 1. Thus option a and b are eliminated. Further, the regular expression is valid for the third option.

Related Questions

Which of the following statements about Regular Expression is/are incorrect? A. The union of two regular expressions is also a regular expression B. The concatenation of two regular expressions is also a regular expression C. The iteration of a regular expression is also a regular expression
A 40 ml K no. of 10 corresponds to a kappa no. of 14.5, 20 corresponds to 30.4 kappa number, and 30 corresponds to __________ kappa number.
Read the passage carefully and choose thebest answer to each question out of the four alternativesand click the button corresponding to it. To know language is to be able to speak it; even a childwho does not yet attend school can speak his or herlanguage. In order to speak a language it is important tolisten to it and to read a few pages in it everyday. A childpicks up language and learns to talk just as (s)he learnsto walk. Walking and talking comes naturally to a child asit grows. In our country, a child may grow up speakingmore than one language, if these languages are spoken inthe home and in the neighbourhood. we call this multilingualism. A child speaks a language or languagesmuch before (s)he starts going to school. To know alanguage then is first of all to be able to speak it as easilyand naturally as a tree year old child does. Later on thechild will learn to read and write in that language. In orderto read and write in a language, one has to speak it. But itis possible to speak a language but not able to read orwrite in it. A baby does not speak until it is nine monthsold but it understands a few words at six months of age.It has been listening ever since it was born, and even alittle before that. So the first strategy in speaking alanguage is to listen. It is necessary for one to __________ the language before(s)he writes in that language.
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable language as a subset. S2: Every finite language is regular. Which one of the following choices is correct?
Let P be a regular language and Q be a context-free language such that Q ⊆ P. (For example, let P be the language represented by the regular expression p*q*and Q be |pnqn | n ϵ N}). Then which of the following is ALWAYS regular?
Read the passage carefully and choose thebest answer to each question out of the four alternativesand click the button corresponding to it. To know language is to be able to speak it; even a childwho does not yet attend school can speak his or herlanguage. In order to speak a language it is important tolisten to it and to read a few pages in it everyday. A childpicks up language and learns to talk just as (s)he learnsto walk. Walking and talking comes naturally to a child asit grows. In our country, a child may grow up speakingmore than one language, if these languages are spoken inthe home and in the neighbourhood. we call thismultilingualism. A child speaks a language or languagesmuch before (s)he starts going to school. To know alanguage then is first of all to be able to speak it as easilyand naturally as a tree year old child does. Later on thechild will learn to read and write in that language. In orderto read and write in a language, one has to speak it. But itis possible to speak a language but not able to read orwrite in it. A baby does not speak until it is nine monthsold but it understands a few words at six months of age.It has been listening ever since it was born, and even alittle before that. So the first strategy in speaking alanguage is to listen. To know a language one must be able to?
Consider the following statements: (1) If n ≥ 3 and m ≥ 3 are distinct positive integers, then the sum of exterior angles of a regular polygon of m sides is different from the sum of exterior angles of regular polygon of n sides (2) Let m, n be integers such that m > n ≥ 3. Then the sum of the interior angles of regular polygon of sides is greater than the sum of interior angles of a regular polygon of n sides, and their sum is (m + n)π/2 Which of the above statements is/are correct?
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which of the following decision problems are undecidable? I. Given a regular expression R and a string w, is w ∈ L(R)? II. Given a context-free grammar G, is L(G) = ϕ? III. Given a context-free grammar G, is L(G) = ∑* for some alphabet ∑? IV. Given a Turing machine M and a string w, is w ∈ L(M)?  
A manufacturing company produces 5 types of chairs in two sizes - Regular" and "Large". The pie charts represent the total number of five types of chairs produced and the table shows the ratio between the number of regular sized and large sized chairs of five types. Type of Chair A B C D E Ration between Number of Regular Size and Large Size Chairs 3 : 2 4 : 5 3 : 1 5 : 3 3 : 8   If the total number of all types of chairs produced is 7200, what is the total number of regular size chairs of all types produced.
If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is _____________