3 votes 3 votes No of states in finite automata whose string length is divisible by 3 or8? Theory of Computation finite-automata theory-of-computation + – Vinil asked Sep 16, 2017 • edited Nov 1, 2017 by LeenSharma Vinil 5.0k views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments LeenSharma commented Nov 1, 2017 reply Follow Share Bhargav D Dave 6 in your NFA 6 should be the final state but if we make state 6 as the final state then your NFA will also accept whose string length 14. I think your NFA is not correct. 0 votes 0 votes LeenSharma commented Nov 1, 2017 reply Follow Share Vinil check my answer for DFA. 0 votes 0 votes Sanandan commented Oct 4, 2020 reply Follow Share The answer will be 24 states. 0 votes 0 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes $\sum= \left \{ a,b \right \}$ Number of states in deterministic finite automata whose string length is divisible by 3 or 8 = 24 states. LeenSharma answered Nov 1, 2017 • selected Nov 1, 2017 by Vinil LeenSharma comment Share Follow See 1 comment See all 1 1 comment reply Vinil commented Nov 1, 2017 reply Follow Share Exactly....! This is correct answer. 1 votes 1 votes Please log in or register to add a comment.