Give regular expressions describing each of the following regular languages over Σ = {0,1}: {w :...

Question

Question

Give regular expressions describing each of the following regular languages over Σ = {0,1}: {w :...

Give regular expressions describing each of the following regular languages over Σ = {0,1}:

{w : |w| = 3}

(PLEASE SHOW WORK)

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Answer:
--------
(0+1)(0+1)(0+1)

Explanation:
--------------
(0+1) matches exactly one 0 or 1
so, three of them (0+1)(0+1)(0+1) matches strings over {0, 1} with length of exactly 3

Add a comment

Answer 2

Similar Homework Help Questions

Give regular expressions describing each of the following regular languages over Σ = {0,1}: {w :...

Give regular expressions describing each of the following regular languages over Σ = {0,1}: {w : w begins and ends with the same symbols} show work!
Provide regular expressions for the following languages: a.) The set of strings over {0,1} whose tenth...

Provide regular expressions for the following languages: a.) The set of strings over {0,1} whose tenth symbol from the right end is 1. b) The set of strings over {0,1} not containing 101 as a sub-string. ***IMPORTANT: PLEASE SHOW ALL WORK AND ALL STEPS, NOT JUST THE ANSWERS!!!
Purpose: Gain experience converting from finite automata to regular expressions. Give regular expressions generating the following...

Purpose: Gain experience converting from finite automata to regular expressions. Give regular expressions generating the following languages over {0,1}. Do these by hand by converting the finite automata. In your answers, you may use the shorthand Σ = (0+1) a. {w | w does not contain the substring 110} b. {w | w is any string except 11 and 111}

Give regular expressions for the following languages: (a) The language of all strings over {a,b} except...

Give regular expressions for the following languages: (a) The language of all strings over {a,b} except the empty string. (b) The language of all strings over {a,b} that contain both bab and bba as substrings. (c)L k = {w ∈ {a,b} * | w contains a substring having 3 more b’s than a’s}. (d) The language of all strings over {a,b} that have a b in every odd position (first symbol is considered position 1; empty string should be accepted)...
Give the regular expressions of the following languages (alphabet is ab): a. {w | w has...

Give the regular expressions of the following languages (alphabet is ab): a. {w | w has a length of at least three and its second symbol is a b} b. {w | w begins with an a and ends with a b} c. {w | w contains a single b} d. {w | w contains at least three a's} e. {w | w contains the substring baba} d. {w | w is a string of even length} e. The empty...
Classify the following languages over {0,1} as finite, regular, cf and beyond cf. Give the smallest...

Classify the following languages over {0,1} as finite, regular, cf and beyond cf. Give the smallest family possible! • At most five occurences of 1 [ ] finite [ ] regular [ ] cf [ ] beyond • Length < 20 [ ] finite [ ] regular [ ] cf [ ] beyond • Length > 20 [ ] finite [ ] regular [ ] cf [ ] beyond

1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w...

1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w | the length of w is at least 2 and has the same symbol in its 2nd and last positions} (b)Draw the state diagram for an NFA for accepting the following language over alphabet {0,1} (Use as few states as possible): {w | w is of the form 1*(01 ∪ 10*)*} (c)If A is a language with alphabet Σ, the complement of A is...
Give regular expressions generating the languages of 1. {w over the alphabet of {0, 1} | w is any string except 11 and 1...

Give regular expressions generating the languages of 1. {w over the alphabet of {0, 1} | w is any string except 11 and 111} 2. {w over the alphabet of {0, 1} | w contains at least two 0’s and at most one 1} 3. {w over the alphabet of {0, 1} | the length of w is at most 9} 4. {w over the alphabet of {0, 1} | w contains at least three 1 s} 5. {w over...
Give context-free grammars generating each of the following languages over Σ = {0, 1}: {w :...

Give context-free grammars generating each of the following languages over Σ = {0, 1}: {w : |w| ≤ 5} {w : |w| > 5 or its third symbol is 1} {w : every odd position of w is 1}

give the regular expressions for each of the following languages u.{xy {a, b}* | the number...

give the regular expressions for each of the following languages u.{xy {a, b}* | the number of as in x is odd and the number of bs in y is even}

Give regular expressions describing each of the following regular languages over Σ = {0,1}: {w :...

Homework Answers