Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Question 4 a) There is a Cookies vending machine that sells a "Rice Cracker" packet for 50 cents and a "Butter Cookies" packet for 30 cents. Construct a simple possible Turing Machine (TM) using appropriate state transition diagram to demonstrate if enough coins have been entered for a purchase. Meaning, the TM constructed should deliver a Rice Cracker packet if coins totalling 50 cents is entered or deliver a Butter Cookies packet if coins totalling 30 cents is entered. Assume that the TM you construct accepts only 10, 20, and 50 cent coins (and no notes) and expects the buyer to give exact change. If coins more than 30 cents (to buy a Rice Cracker pack) or 50 cents (to buy a Butter Cookies pack) is given, then the TM just returns all the money. The TM should have one final state each for "Rice Cracker", and "Butter Cookies", and an 'error state' if excess of coins is entered returning all the money.

Question 4 a) There is a Cookies vending machine that sells a "Rice Cracker" packet for 50 cents and a "Butter Cookies" packet for 30 cents. Construct a simple possible Turing Machine (TM) using appropriate state transition diagram to demonstrate if enough coins have been entered for a purchase. Meaning, the TM constructed should deliver a Rice Cracker packet if coins totalling 50 cents is entered or deliver a Butter Cookies packet if coins totalling 30 cents is entered. Assume that the TM you construct accepts only 10, 20, and 50 cent coins (and no notes) and expects the buyer to give exact change. If coins more than 30 cents (to buy a Rice Cracker pack) or 50 cents (to buy a Butter Cookies pack) is given, then the TM just returns all the money. The TM should have one final state each for "Rice Cracker", and "Butter Cookies", and an 'error state' if excess of coins is entered returning all the money.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

w4

Question 4 a) There is a Cookies vending machine that sells a "Rice Cracker" packet for 50 cents and a "Butter Cookies" packet for 30 cents. Construct a simple possible Turing Machine (TM) using appropriate state transition diagram to demonstrate if enough coins have been entered for a purchase. Meaning, the TM constructed should deliver a Rice Cracker packet if coins totalling 50 cents is entered or deliver a Butter Cookies packet if coins totalling 30 cents is entered. Assume that the TM you construct accepts only 10, 20, and 50 cent coins (and no notes) and expects the buyer to give exact change. If coins more than 30 cents (to buy a Rice Cracker pack) or 50 cents (to buy a Butter Cookies pack) is given, then the TM just returns all the money. The TM should have one final state each for "Rice Cracker", and "Butter Cookies", and an 'error state' if excess of coins is entered returning all the money. b) Explain by proof of contradiction using the Pumping Lemma that the language L = {a?nb°a" |n > 0} is not regular.
Transcribed Image Text:Question 4 a) There is a Cookies vending machine that sells a "Rice Cracker" packet for 50 cents and a "Butter Cookies" packet for 30 cents. Construct a simple possible Turing Machine (TM) using appropriate state transition diagram to demonstrate if enough coins have been entered for a purchase. Meaning, the TM constructed should deliver a Rice Cracker packet if coins totalling 50 cents is entered or deliver a Butter Cookies packet if coins totalling 30 cents is entered. Assume that the TM you construct accepts only 10, 20, and 50 cent coins (and no notes) and expects the buyer to give exact change. If coins more than 30 cents (to buy a Rice Cracker pack) or 50 cents (to buy a Butter Cookies pack) is given, then the TM just returns all the money. The TM should have one final state each for "Rice Cracker", and "Butter Cookies", and an 'error state' if excess of coins is entered returning all the money. b) Explain by proof of contradiction using the Pumping Lemma that the language L = {a?nb°a" |n > 0} is not regular.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS