edited by
265 views

1 Answer

0 votes
0 votes
but, the given expression is context-free where we can prove it by using PDA in which we push every kth a onto the stack and will pop a for every b. thus, proving it to be context-free.

Related questions

666
views
1 answers
0 votes
admin asked May 4, 2019
666 views
Let $G$ be a $CFG$ in Chomsky normal form that contains $b$ variables$.$ Show that if $G$ generates some string with a derivation having at least $2^{b}$ steps$, L(G)$ is...
1.3k
views
1 answers
1 votes
admin asked May 4, 2019
1,253 views
Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$ $S\rightarrow TT\mid U$ $T\rightarrow 0T\mid T...
707
views
2 answers
0 votes
admin asked May 4, 2019
707 views
Let $\Sigma = \{1, 2, 3, 4\}$ and $C = \{w\in\Sigma^{*}\mid$ $\text{in }w,\text{ the number of }1\text{'s equals the number of }2\text{'s, and the number of } 3\text{'s ...
1.5k
views
1 answers
2 votes
admin asked May 4, 2019
1,531 views
Let $B$ be the language of all palindromes over $\{0,1\}$ containing equal numbers of $0's$ and $1's.$ Show that $B$ is not context free$.$