The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
24 views

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?

asked in Theory of Computation by Active (1.2k points) | 24 views
0
Is this self-doubt ?

1 Answer

0 votes
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.
answered by Boss (21.8k points)

Related questions

0 votes
2 answers
1


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

47,139 questions
51,388 answers
178,055 comments
66,699 users