Register

Ullman (TOC) Edition 3 Exercise 3.4 Question 1 (Page No. 121 - 122)

• edited by
820 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
admin asked Apr 3, 2019
484 views
Ullman (TOC) Edition 3 Exercise 3.4 Question 3 (Page No. 122)
We developed the regular expression $(0+1)^{*}1(0+1)+(0+1)^{*}1(0+1)(0+1)$ Use the distributive laws to develop two different,simpler,equivalent expressions.
We developed the regular expression $(0+1)^{*}1(0+1)+(0+1)^{*}1(0+1)(0+1)$ Use the distributive laws to develop two different,simpler,equivalent expressions.
User Avatar
1 votes
1 votes
0 answers
2
admin asked Apr 3, 2019
1,334 views
Ullman (TOC) Edition 3 Exercise 3.4 Question 2 (Page No. 122)
Prove or disprove each of the following statements about regular expressions. $(R+S)^{*}=R^{*}+S^{*}$ $(RS+R)^{*}R=R(SR+R)^{*}$ $(RS+R)^{*}RS=(RR^{*}S)^{*}$ $(R+S)^{*}S=(R^{*}S)^{*}$ $S(RS+S)^{*}R=RR^{*}S(RR^{*}S)^{*}$
Prove or disprove each of the following statements about regular expressions.$(R+S)^{*}=R^{*}+S^{*}$$(RS+R)^{*}R=R(SR+R)^{*}$$(RS+R)^{*}RS=(RR^{*}S)^{*}$$(R+S)^{*}S=(R^{*...
User Avatar
0 votes
0 votes
0 answers
3
admin asked Apr 3, 2019
245 views
Ullman (TOC) Edition 3 Exercise 3.1 Question 4 (Page No. 92)
Give English descriptions of the languages of the following regular expressions$:$ $(1+\in)(00^{*}1)^{*}0^{*}$ $(0^{*}1^{*})^{*}000(0+1)^{*}$ $(0+10)^{*}1^{*}$
Give English descriptions of the languages of the following regular expressions$:$$(1+\in)(00^{*}1)^{*}0^{*}$$(0^{*}1^{*})^{*}000(0+1)^{*}$$(0+10)^{*}1^{*}$
User Avatar
0 votes
0 votes
0 answers
4
admin asked Apr 3, 2019
405 views
Ullman (TOC) Edition 3 Exercise 3.4 Question 4 (Page No. 123)
Prove that $(L^{*}M^{*})^{*}=(L+M)^{*}.$Complete the proof by showing that strings in $(L^{*}M^{*})^{*}$ are also in $(L+M)^{*}.$
Prove that $(L^{*}M^{*})^{*}=(L+M)^{*}.$Complete the proof by showing that strings in $(L^{*}M^{*})^{*}$ are also in $(L+M)^{*}.$
User Avatar
Link Copied!