Share
Explore BrainMass

Theory of Computation with a Vending Machine

Problem: Consider a vending machine that accepts nickels, dimes and quarters.
1. Give an implicit definition of the set of all strings whose value mod 30 = 0.
2. Give recursive definition of the set of all strings whose value = 30 cents.

See attachment for the full and formatted problem.

Attachments

Solution Summary

The solution is given in a clearly-formatted word document.

$2.19