theory of computation

Question

What is the maximum number of productions possible in the regular grammar equivalent to n-state DFA over input alphabet {a,b,c} where qi is always initial state?

Comments

Is this self-doubt ?

Answer 1

There is No such Maximum number. For any regular language there could be infinite regular grammars possible. And hence the maximum number could be anything. Say, You give a Grammar with 100 productions and claim that it is maximum....then I would just add another useless productions to this grammar and make it 101 productions.