Register

Context Free Grammar

338 views
0 votes
0 votes
L={a^nb^n;n>=0,n!=13} is

a.DCFL

b.CFL but not DCFL

c.not CFL

d.a recursive set but not CFL
User Avatar

1 Answer

Best answer
3 votes
3 votes

L={anbn } - {a13b13}

which is DCFL - Regular and that results DCFL...

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
moe12leb asked Jan 21, 2023
280 views
context free grammar
S→ aS | bS | epsilon what is the language generated by this grammar ?
S→ aS | bS | epsilonwhat is the language generated by this grammar ?
User Avatar
0 votes
0 votes
2 answers
2
moe12leb asked Jan 21, 2023
275 views
context free grammar
what is the langauge generated by this grammar ? S-->aS | aSbS | ε what is the language
what is the langauge generated by this grammar ?S >aS | aSbS | ε what is the language
User Avatar
0 votes
0 votes
0 answers
3
moe12leb asked Nov 28, 2022
221 views
Context Free Grammar
Find context-free grammars for the following language L = { w : na(w) = 2nb(w); where w belongs {a, b}*}
Find context-free grammars for the following languageL = { w : na(w) = 2nb(w); where w belongs {a, b}*}
User Avatar
0 votes
0 votes
1 answer
4
moe12leb asked Nov 28, 2022
356 views
Context Free Grammar
Find context-free grammars for the following language The complement of the language L = belongs {a^n, b^n}
Find context-free grammars for the following languageThe complement of the language L = belongs {a^n, b^n}
User Avatar
Link Copied!