Find a grammar for the language {a^nba^n+2 | n >=0}

By: Prof. Dr. Fazal Rehman | Last updated: February 3, 2024

Language = {aⁿ b aⁿ⁺² | n >=0}

CFG 

S-> a S a | a X a

X -> bC

C -> aa

Valid strings

These strings must be accepted by our Context-free Grammar.

{ abaaa, aabaaaa, aaabaaaaa,……… }

InValid strings

These strings must be rejected by our Context-free Grammar.

{ aba, aabaa, abba,……… }

More Examples of CFG

1. Intro to Context Free Grammar with 12 Examples
2. CFG of Language of all even and odd length palindromes
3. Context Free Grammar CFG for language of all even length strings
4. CFG for the language of all non Palindromes
5. CFG for strings with unequal numbers of a and b
6. CFG of odd Length strings {w | the length of w is odd}
7. CFG of Language contains at least three 1’s or three a’s {w | w contains at least three 1’s}
8. CFG for the language L = 0ⁿ1ⁿ where n>=1
9. CFG for the language L = 0ⁿ1²ⁿ where n>=1
10. Write a CFG for the language L = 0ⁿ1⁴ⁿ where n>=1
11. CFG for {aⁿ b aⁿ⁺¹ | n >=0}
12. CFG for {aⁿ b aⁿ⁺² | n >=0}
13. CFG for {aⁿ b aⁿ⁺³ | n >=0}