1. Construct DFAs that recognize the following languages over the alphabet {a,b}: (a) {w; w contains...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
1. Construct DFAs that recognize the following languages over the alphabet {a,b}: (a) {w; w contains exactly two b's, or an even number of a's} (b) {ww contains as substring ababb and/or bbb }. (c) {w w is any string except the two strings abba and aba} Draw the state diagram for all; add a formal description of the DFA for (b), and add a proof that your DFA recognizes exactly the specified language for (c)). To do this, you will need to prove that (1) your DFA accepts all strings in the language and (2) any string accepted is in the language. 2. Problem 1.16 (a) page 86 of the textbook Sipser - second edition (convert NFA to DFA). Please see the scan on Blackboard. Show intermediate steps, if any. 3. For each of the following give two strings that are members of the language, and two strings that are not members of the language. Assume the alphabet = = {0, 1}. 1. *00*12*. 2. (1 U10 U00)* 3. (111)*. 4. Give regular expressions generating the languages of Exercise 1. For (a), prove (by induction) that the language of your expression is equal to the language as described in (a). 5. Problem 1.21(a) page 86 of the textbook Sipser - second edition (convert DFA to regular expres- sion). Please see the scan on Blackboard. Show intermediate steps, if any. 6. Construct state diagrams of NFA's accepting languages specified by the following regular expres- sions: 1. (21)* U2* 2. (213)*2* 3. (12 U11)* (21 U 22)* 1. Construct DFAs that recognize the following languages over the alphabet {a,b}: (a) {w; w contains exactly two b's, or an even number of a's} (b) {ww contains as substring ababb and/or bbb }. (c) {w w is any string except the two strings abba and aba} Draw the state diagram for all; add a formal description of the DFA for (b), and add a proof that your DFA recognizes exactly the specified language for (c)). To do this, you will need to prove that (1) your DFA accepts all strings in the language and (2) any string accepted is in the language. 2. Problem 1.16 (a) page 86 of the textbook Sipser - second edition (convert NFA to DFA). Please see the scan on Blackboard. Show intermediate steps, if any. 3. For each of the following give two strings that are members of the language, and two strings that are not members of the language. Assume the alphabet = = {0, 1}. 1. *00*12*. 2. (1 U10 U00)* 3. (111)*. 4. Give regular expressions generating the languages of Exercise 1. For (a), prove (by induction) that the language of your expression is equal to the language as described in (a). 5. Problem 1.21(a) page 86 of the textbook Sipser - second edition (convert DFA to regular expres- sion). Please see the scan on Blackboard. Show intermediate steps, if any. 6. Construct state diagrams of NFA's accepting languages specified by the following regular expres- sions: 1. (21)* U2* 2. (213)*2* 3. (12 U11)* (21 U 22)*
Expert Answer:
Related Book For
Posted Date:
Students also viewed these algorithms questions
-
answer the question clearly You are building a flight-control system for which a convincing safety case must be made. Would you assign the tasks of safety requirements engineering, test case...
-
In this question assume that p and q are atomic formulae. (a) Compare and contrast path formulae and state formulae in temporal logic. [4 marks] (b) Describe and contrast the meanings of F(G p) and...
-
(You can use other websites for this question) The Chicago Bulls realize that they've sucked since the 90s because they have relied on one start player for too long (Jordan, Rose), and that Machine...
-
Teuvo Company entered into two contracts on the same date with Rundblad Corporation. Teuvo has provided the following analysis of price and cost for the contracts:...
-
What is business process reengineering?
-
Problem 8 is the same as problem 7 with respect to initial measurement of the ARO liability. Now assume that Tadpoles credit standing improves over time, causing the credit-adjusted risk-free rate to...
-
Ceda Co. has equipment that cost $80,000 and that has been depreciated $50,000. Instructions Record the disposal under the following assumptions. (a) It was scrapped as having no value. (b) It was...
-
Scenario 11:Accountant 11 is a senior accountant. She says: I recommended a wonderful coffee serviceto my audit client, I received a commission from the coffee service company, can I take...
-
Represent in the Argand Diagram all such z for which |z- 12 2i| > 7 [6]
-
READ: KPJ Healthcare: the first 30 years Zizah CheSenik,Rosmah MatIsa,NorehaHalid,AdlinMasood,Soo-WahLow,Khairul AkmaliahAdham Publication date: 10 October 2013 Issue publication date: 10 October...
-
10. Refer to the graphs below. According to an article published in Business Week in October 2002, "The stock market plunge is weighing heavily on the both, businesses and consumers". The graph that...
-
In the project initiation phase, the sponsor asked the project manager to provide an approximate cost estimate for the project by the end of the day. What should the project manager do in this...
-
Starting a new company requires that we have a plan for who will sell to and how we will satisfy those sales orders. For Week 4, submit a 1-page summary with 3 customer profiles. Who are your...
-
This discussion is intended to get feedback for us in designing future curricula and programs that will best suit the preparation of you and those who are coming in after you to enter a dynamic...
-
Q1) Discuss history of the implementation of the Statute of Frauds in the United States Q2) Statute of Frauds why must a contract that obviously cannot be completed within one year be in writing? Q3)...
-
Time Solutions, Inc. is an employment services firm that places both temporary and permanent workers with a variety of clients. Temporary placements account for 70% of Time Solutions' revenue;...
-
Use the construction in the proof of Theorem 1.47 to give the state diagrams of NFAs recognizing the concatenation of the languages described in a. Exercises 1.6g and 1.6i. b. Exercises 1.6b and...
-
Show how the circuit depicted in Figure 9.26 computes on input 0110 by showing the values computed by all of the gates, as we did in Figure 9.24. Figure 9.26 Figure 9.24 13 12 V
-
Let G be a CFG in Chomsky normal form that contains b variables. Show that if G generates some string with a derivation having at least 2b steps, L(G) is infinite.
-
Perhaps the most famous case illustrating the enormous cost of winning back lost customers is that of the Tylenol Murders. Seven people in the Chicago area died suddenly after taking Tylenol...
-
Describe the concept of MBWA.
-
Give a brief rationale for empowerment.
Study smarter with the SolutionInn App