Question:medium

The minimum number of productions required to produce a language consisting of palindrome strings over \(\Sigma=\{a,b\}\) is

Show Hint

Standard palindrome CFG: \[ S\rightarrow aSa\;|\;bSb\;|\;a\;|\;b\;|\;\epsilon \] contains exactly five productions.
Updated On: Jun 25, 2026
  • 3
  • 7
  • 5
  • 6
Show Solution

The Correct Option is C

Solution and Explanation

Was this answer helpful?
0

Top Questions on Theory of Computations

Questions Asked in TS PGECET exam