Register

Ullman (TOC) Edition 3 Exercise 2.4 Question 2 (Page No. 72)

• edited by
719 views
2 votes
2 votes

Design NFA's to recognize the following sets of strings.

  1. $abc,abd,$ and $aacd.$ Asssume the alphabet is $\{a,b,c,d\}$
  2. $0101,101,$ and $011.$ Asssume the alphabet is $\{0,1\}$
  3. $ab,bc,$ and $ca.$ Asssume the alphabet is $\{a,b,c\}$

Convert each of your NFA's to DFA's.

• 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

3 votes
3 votes
0 answers
1
admin asked Apr 3, 2019
1,784 views
Ullman (TOC) Edition 3 Exercise 2.4 Question 1 (Page No. 71 - 72)
Design NFA's to recognize the following sets of strings. $abc,abd,$ and $aacd.$ Assume the alphabet is $\{a,b,c,d\}$ $0101,101,$ and $011.$ Assume the alphabet is $\{0,1\}$ $ab,bc,$ and $ca.$ Assume the alphabet is $\{a,b,c\}$
Design NFA's to recognize the following sets of strings.$abc,abd,$ and $aacd.$ Assume the alphabet is $\{a,b,c,d\}$$0101,101,$ and $011.$ Assume the alphabet is $\{0,1\}$...
User Avatar
1 votes
1 votes
0 answers
2
admin asked Apr 3, 2019
1,322 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
197 views
Ullman (TOC) Edition 3 Exercise 3.2 Question 4 (Page No. 108)
Convert the following regular expressions to NFA's with $\in-$transactions. $01^{*}$ $(0+1)01$ $00(0+1)^{*}$
Convert the following regular expressions to NFA's with $\in-$transactions.$01^{*}$$(0+1)01$$00(0+1)^{*}$
User Avatar
Link Copied!