# Theory of Computation with a Vending Machine

Not what you're looking for? Search our solutions OR ask your own Custom question.

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.

Â© BrainMass Inc. brainmass.com March 4, 2021, 5:56 pm ad1c9bdddfhttps://brainmass.com/computer-science/arrays/theory-computation-vending-machine-19515

#### Solution Preview

Please see attached file.

Solution:

1.

= { str | (str Îµ C* ) âˆ§ ( (value(str) mod 30 ) = 0 ) }

2. Let describe the set of all strings whose sum is 30.

Basis case: nnnnn âˆˆ ,

nq âˆˆ and qn âˆˆ ...

#### Solution Summary

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

$2.49