recategorized by
2,139 views

2 Answers

Answer:

Related questions

6 votes
6 votes
2 answers
2
go_editor asked Jul 13, 2016
9,647 views
The minimum number of states of the non-deterministic finite automaton which accepts the language$\{ a b a b^n \mid n \geq 0 \} \cup \{ a b a^n \mid n \geq 0 \}$ is3456