Explore BrainMass


(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?

Solution Summary

This shows how to construct finite automatons.