1. Mathematics
2. Discrete Math
3. Finite Element Method
4. 15799

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

(a)For each of the following languages over the unary alphabet {a}, construct a finite automaton accepting it.

i. {a^2}
ii. {a^2, a^3, a^4}

(b) Let A be any finite nonempty subset of {a, a^2, a^3, a^4,...}. Is there always a finite automaton that accepts A?