Register

Ullman (TOC) Edition 3 Exercise 3.1 Question 3 (Page No. 92)

• edited by
351 views
0 votes
0 votes

Write regular expressions for the following languages$:$

  1. The set of all strings of $0's$ and $1's$ not containing $101$ as a substring.
  2. The set of all strings with an equal number of $0's$ and $1's,$ such that no prefix has two more $0'$ than $1's,$ nor two more $1's$ than  $0's.$
  3. The set of strings of $0's$ and $1's$ whose number of $0's$ is divisible by five and whose number of $1's$ is even.
• edited by
User Avatar

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
247 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
2
admin asked Apr 3, 2019
822 views
Ullman (TOC) Edition 3 Exercise 3.4 Question 1 (Page No. 121 - 122)
Verify the following identities involving regular expressions. $R+S=S+R$ $(R+S)+T=R+(S+T)$ $(RS)T=R(ST)$ $R(S+T)=RS+RT$ $(R+S)T=RT+ST$ $(R^{*})^{*}=R^{*}$ $(\in+R)^{*}=R^{*}$ $(R^{*}S^{*})^{*}=(R+S)^{*}$
Verify the following identities involving regular expressions.$R+S=S+R$$(R+S)+T=R+(S+T)$$(RS)T=R(ST)$$R(S+T)=RS+RT$$(R+S)T=RT+ST$$(R^{*})^{*}=R^{*}$$(\in+R)^{*}=R^{*}$$(R...
User Avatar
Link Copied!