Register

context free language

• retagged by
769 views
3 votes
3 votes

Consider the languages 
L1 = {babaabaaab…ba(n-1) ban b | n ≥ 1}
L2=Complement(L1) 

L1 is not a CFL but L2 is, How?

• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
practicalmetal asked Mar 20, 2023
371 views
Context Free Language
The complement of the languages: i) {ww | w in (0+1)*} ii) {$a^n b^nc^n$ | n>1} are a) Context Free b) Not Context Free c)are DCFL’s d)None
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None
User Avatar
0 votes
0 votes
1 answer
3
swami_9 asked Jul 16, 2022
551 views
Context free language
Why the complement of a CFL is CSL?
Why the complement of a CFL is CSL?
User Avatar
1 votes
1 votes
1 answer
4
Abhipsa asked Jan 22, 2019
290 views
Context free language
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is even Thanks!
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is evenThanks!
User Avatar
Link Copied!