1 votes 1 votes The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is 3 4 5 6 Theory of Computation ugcnetsep2013ii theory-of-computation finite-automata + – go_editor asked Jul 20, 2016 recategorized May 24, 2020 go_editor 3.6k views answer comment Share Follow See 1 comment See all 1 1 comment reply Arunav Khare commented May 14, 2017 reply Follow Share Five states would be needed 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes ans is C 5 states Sanjay Sharma answered Jul 20, 2016 selected Jul 20, 2016 by LeenSharma Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Only 5 states are needed. LeenSharma answered May 14, 2017 LeenSharma comment Share Follow See all 0 reply Please log in or register to add a comment.