in Theory of Computation edited by
1,307 views
2 votes
2 votes

Consider the regular grammar generating the set of all strings ending in 00

S $\rightarrow$ 1S $\mid$ 0P

P $\rightarrow$ 0C $\mid$ 0 $\mid$ 1S

The production missing is

  1.  C $\rightarrow$ 1S
  2. B $\rightarrow$ C1
  3. D $\rightarrow$ C1
  4. A $\rightarrow$ $\varepsilon$

Solution is given option A

in Theory of Computation edited by
by
1.3k views

3 Answers

5 votes
5 votes
The answer is (a) . If the que. is complete b'coz other option looks useless here.

1 comment

this waht happens in wrongly prepared materials....
1
1
2 votes
2 votes

no option match

0 votes
0 votes
There is no c productions in the answer so that's why we consider option A to compete the grammar

1 comment

answer is 1S/0C
0
0

Related questions

1 vote
1 vote
1 answer
2