Explore BrainMass


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?

© BrainMass Inc. brainmass.com October 24, 2018, 5:37 pm ad1c9bdddf

Solution Summary

This shows how to construct finite automatons.

See Also This Related BrainMass Solution

Testing for Useless States in Pushdown Automata

A useless state in a pushdown automaton is never entered on any input string. Consider the problem of testing whether a pushdown automaton has any useless states. Formulate this problem as a language and show that it is decidable.

View Full Posting Details