The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is
- a)3
- b)7
- c)5
- d)6
Correct answer is option 'C'. Can you explain this answer?
Related Test
|
DIVYA ADITYA
Sep 20, 2019 |
|
The grammar which produces a palindrome set can be written as:
S-> aSa | bSb | e | a | b
L={e, a, b, aba, abbbaabbba…..}
S-> aSa | bSb | e | a | b
L={e, a, b, aba, abbbaabbba…..}
The grammar which produces a palindrome set can be written as:S-> aSa | bSb | e | a | bL={e, a, b, aba, abbbaabbba…..}
Top Courses for Computer Science Engineering (CSE)
Related Content
 |
|
 |
|
 |
|
 |
|
 |
Download free EduRev App
Track your progress, build streaks, highlight & save important lessons and more!
The grammar which produces a palindrome set can be written as:S-> aSa | bSb | e | a | bL={e, a, b, aba, abbbaabbba…..}
|
© EduRev
|
Follow Us
|
