0 votes 0 votes How many maximum number of production rules are possible in regular grammar equivalent to a given n state DFA, over the input alphabet {a,b,c} where q1 is always the initial state? Answer: 6n + 1 Theory of Computation theory-of-computation finite-automata + – debanjan sarkar asked Jan 4, 2019 debanjan sarkar 686 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Jan 4, 2019 reply Follow Share i am getting 3n+1, but how it is 6n+1 ? what is their explanation ? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 6n+2 coz you can have both final states also abhishek14893 answered Jan 10, 2019 abhishek14893 comment Share Follow See all 0 reply Please log in or register to add a comment.
