Question

In: Computer Science

Prove the following using the properties of regular expressions: (ab)* + c + c* = Λ...

Prove the following using the properties of regular expressions:

  1. (ab)* + c + c* = Λ + ab + (ab)* + c(Λ + c*)  
  2. Λ+ab+abab+ababab(ab)* = Λ + ∅* + (ab)*
  3. a(b+c*) + (d+e)* = ab + ac*c* + d + e + (d+e)*
  4. a*b + a*a*bc* + d* + ab = d* + ab + a*bc* + Λ
  5. a(b+cd*) = a(b+c) + acdd*
  6. (a+b)* = ∧* + ∅* + (a*b*)*
  7. (ab)*(c*+d*) = (ab)*(c+c*) + (ab)*( ∧ + d*)

Solutions

Expert Solution

venereology answered 8 months ago
Next > < Previous

Related Solutions

Suppose A and B are regular language. Prove that AB is regular
Suppose A and B are regular language. Prove that AB is regular
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C...
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C + A'BC + AB'C + ABC 3B) F(A,B,C) = A'B'C' + A'B'C + AB'C' + AB'C + ABC' + ABC
What do these regular expressions mean in plain english? a) ba*b + (ab)* b) a*b* +...
What do these regular expressions mean in plain english? a) ba*b + (ab)* b) a*b* + b*ab
1. Simplify the following expressions using Boolean algebra. a.A+AB b.AB+AB' c.A'BC+AC d.A'B+ABC'+ABC
1. Simplify the following expressions using Boolean algebra. a.A+AB b.AB+AB' c.A'BC+AC d.A'B+ABC'+ABC
Using Euclid's Propositions: 1. Prove that the regular octagon is constructible. 2. Prove that the regular...
Using Euclid's Propositions: 1. Prove that the regular octagon is constructible. 2. Prove that the regular decagon is constructible.
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified A. X’Y + XY B. (X + Y)(X + Y’) C. (A’ + B’) (A + B)’ D. ABC + A’B + A’BC’ E. XY + X(WZ + WZ’)
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified. A. A’B + AB B. XY + X(WZ + WZ’) C. X’Y’(X’+Y)(Y’+Y) D. ABC + A’B + A’BC’ E. (A+B)(AC+AC’)+AB+B Draw the circuit logic diagrams for both the original and simplified expressions.
Linux regular expressions: file name: lab3test.txt Create regular expressions that meet the following criteria. You may...
Linux regular expressions: file name: lab3test.txt Create regular expressions that meet the following criteria. You may use grep or egrep to answer these questions. 1.Match any lines that contain a phone number with the format 222-222-2222.
linux Regular expressions file name: lab3test.txt Create regular expressions that meet the following criteria. You may...
linux Regular expressions file name: lab3test.txt Create regular expressions that meet the following criteria. You may use grep or egrep to answer these questions. 1.Display all lines where the employee’s age is greater than 40 years old. Again, don’t think of this as a number, think of it as a series of characters.
Is the L(r1) = L(r2) where r1 = (ab*+c)(λ+∅) and r2 = (a+c)(b*+∅)? what are the...
Is the L(r1) = L(r2) where r1 = (ab*+c)(λ+∅) and r2 = (a+c)(b*+∅)? what are the languages of L(r1), L(r2)? show the definition's using regular expression, assume Σ = (a,b,c)
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT