Consider the following regular expression r. 1(0+1)0(0+1)1 1.In words, describe the language L(r). Please explain

Question

Question

Consider the following regular expression r. 1(0+1)0(0+1)1 1.In words, describe the language L(r). Please explain

Consider the following regular expression r.

1(0+1)*0(0+1)*1

1.In words, describe the language L(r).

Please explain

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

This will be a language with minimum 5 letter in the string that starts up with 1 and ends with 1.And the middle value will be 0.Compulsary two one and one 0 will be there in this language.

Grammar:

S-> 1S1 | 1A0A1

A->1a|0a

a->0|1 | ε

Add a comment

Answer 2

Similar Homework Help Questions

Please explain the answer shortly! :) The language of the regular expression (0+10)* is the set...

Please explain the answer shortly! :) The language of the regular expression (0+10)* is the set of all strings of O's and 1's such that every 1 is immediately followed by a 0. Describe the complement of this language (with respect to the alphabet {0,1}) and identify in the list below the regular expression whose language is the complement of L((0+10)*). (0+1)*11(0+1)* (1+01)* (0+11)* (0+1)*1(8+1(0+1)*)
(4) [20 pts] Let L be the language defined by a regular expression (O | 1)0+(01 1)). over t alphabet f(o,1, +) (a) (4pt) Write down 5 different words from L (b) (8pt) Describe L using words. (c) (8pt...

(4) [20 pts] Let L be the language defined by a regular expression (O | 1)0+(01 1)). over t alphabet f(o,1, +) (a) (4pt) Write down 5 different words from L (b) (8pt) Describe L using words. (c) (8pt) Draw an automaton accepting L (ideally, deterministic). (4) [20 pts] Let L be the language defined by a regular expression (O | 1)0+(01 1)). over t alphabet f(o,1, +) (a) (4pt) Write down 5 different words from L (b) (8pt) Describe...
7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(...

7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(((aa 7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(((aa

10. Consider the following CFG: Is the language generated by this CFG a regular language? If so, give a regular expression denoting it. If not, prove it. 10. Consider the following CFG: Is the l...

10. Consider the following CFG: Is the language generated by this CFG a regular language? If so, give a regular expression denoting it. If not, prove it. 10. Consider the following CFG: Is the language generated by this CFG a regular language? If so, give a regular expression denoting it. If not, prove it.
Write a legal regular expression for the following regular language. L = { w | w...

Write a legal regular expression for the following regular language. L = { w | w ∊ (0 + 1)* and w contains an even number of 1’s AND an even number of 0’s}.
REGULAR EXPRESSION DESCRIBE

Describe the language over {0,1} of the Regular Expression R = (0+1)(0+1)*

Construct a regular expression that defines the language L (say) containing all the words with either...

Construct a regular expression that defines the language L (say) containing all the words with either exactly one aba-substring or exactly one bab-substring but not both aba- and bab-substrings. (Hint: For example, the word abab does not belong to L.)
Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}:...

Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}: The language consisting of the set of all bit strings that start with 00 or end with 101 (or both). Syntax The union is expressed as R|R, star as R*, plus as R+, concatenation as RR. Epsilon is not supported but you can write R? for the regex (R|epsilon).
Let A={a,b,c}. Describe the language L(r) for each of the following regular expressions: (a) rFab*c; (b)r=(abuc)*;...

Let A={a,b,c}. Describe the language L(r) for each of the following regular expressions: (a) rFab*c; (b)r=(abuc)*; (c) r=abuc*.

Problem 24.3. Describe in words the language accepted by each automaton, and also give a regular...

Problem 24.3. Describe in words the language accepted by each automaton, and also give a regular expression.

Consider the following regular expression r. 1(0+1)0(0+1)1 1.In words, describe the language L(r). Please explain

Homework Answers

Add Answer to:
Consider the following regular expression r. 1(0+1)0(0+1)1 1.In words, describe the language L(r). Please explain

Post as a guest

Earn Coins

Please explain the answer shortly! :) The language of the regular expression (0+10)* is the set...

(4) [20 pts] Let L be the language defined by a regular expression (O | 1)0+(01 1)). over t alphabet f(o,1, +) (a) (4pt) Write down 5 different words from L (b) (8pt) Describe L using words. (c) (8pt...

7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(...

10. Consider the following CFG: Is the language generated by this CFG a regular language? If so, give a regular expression denoting it. If not, prove it. 10. Consider the following CFG: Is the l...

Write a legal regular expression for the following regular language. L = { w | w...

REGULAR EXPRESSION DESCRIBE

Construct a regular expression that defines the language L (say) containing all the words with either...

Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}:...

Let A={a,b,c}. Describe the language L(r) for each of the following regular expressions: (a) rFabc; (b)r=(abuc);...

Problem 24.3. Describe in words the language accepted by each automaton, and also give a regular...

Consider the following regular expression r. 1(0+1)*0(0+1)*1 1.In words, describe the language L(r). Please explain

Homework Answers