• edited by
545 views

1 Answer

0 0 votes
The maximum number of productions in an equivalent CNF of a CFG is given by

(k-1) x P + T

Where k is the maximum number of symbols on the right hand side of the productions of the CFG

P is the number of productions

T is the number of terminals

Hence here (3-1) x 5 + 1 gives 11.

Hence A.
Position:
Show:

Related questions

0 0 votes
0 0 answers
307
307 views
AnkurGarg asked Jul 28, 2018
307 views
1 1 vote
0 0 answers
463
463 views
AnkurGarg asked Jul 28, 2018
463 views
0 0 votes
1 1 answer
33
33 views
GO Classes asked 3 days ago
33 views
Consider the following statements about automata and formal languages.Deterministic and nondeterministic finite automata accept the same class of languages. For every con...
0 0 votes
1 1 answer
37
37 views
GO Classes asked 4 days ago
37 views
Consider the following statements:Every nondeterministic finite automaton can be simulated by a deterministic finite automaton. Every deterministic finite automaton can b...