Register

Search results for toc

0 votes
1 answer
1
Made-easy test series
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
User Avatar
To see more, click for the full list of questions or popular tags.