Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Identify the type of automata that may accept the language, L = {a*b*}
Pushdown Automata
Neither Finite Automata nor Pushdown automata
Finite Automata
Both Finite Automata and Pushdown automata
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!