in Theory of Computation retagged by
459 views
3 votes
3 votes

Complete the following production rules which generate the language:$$L= \left\{a^{n} b^{n} c^{n}\mid a, b, c \in \Sigma \right\}$$ where variables $R$ and $Q$ are used to move back and forth over the current string generated

  • $S \rightarrow aYc$
  • $Y \rightarrow a Yc\mid Q$
  • $Qc \rightarrow Rc$
  • $cR \rightarrow Rc$
  • $aR \rightarrow a - Q$
  • $bR \rightarrow b - Q$
  • $Qb \rightarrow ...$
  • $Qc \rightarrow cQ$
  • $Q \rightarrow R'c$
  • $cR' \rightarrow ...$
  • $bR' \rightarrow ...$
  • $aR' \rightarrow a...$
in Theory of Computation retagged by
459 views

1 comment

What's the "$-$" in $aR \rightarrow a - Q$ ?
0
0

Please log in or register to answer this question.

Related questions