Register

Context Free Language

1,766 views
0 0 votes

CFL Over one alphabet will always be regular

  1. True
  2. False

1 Answer

Best answer
4 4 votes

Here question indicate one thing ...

THE GIVEN LANGUAGE IS CFL...now one more point is its defined on only one alphabet ....so examples of such languages are ..

a^n,b^n...you can put any condition on n....

now if INPUT ITSELF IS ONE ALPHABET...we have no other alphabet for compare..so no need of STACK also ...and the language become REGULAR...

so statement is TRUE...

ex a^n such that n<1000 ...we can draw DFA..

a^n such that 1886<n<2000...we can have DFA...

any language over one alphabet is REGULAR...BUT PROVIDED THAT IT MUST BE CFL FIRST..

that is we cant say here a^n ...where n is prime number ....as language itself is not CFL ...no need of ckeck...

SO LANGUAGE MUST BE CFL...and also if its on one alphabet ...its "REGULAR" always..

• selected by
Voting & Accepting an answer helps improve the community
← Previous · #GRAPH THEORYNext → · #Ace_test
← Previous in category · Regular ExpressionNext in category → · Regular Expression
Position:
Show:

Related questions

0 0 votes
0 0 answers
146
146 views
lambodar_pal asked Jul 27
146 views
intersection of a context free language and a regular language
The intersection of a context free language and a regular languagea)need not be regularb)need not be context freec) is always regulard) is always context free  
1 1 vote
0 0 answers
429
429 views
dazeeee asked Apr 3, 2024
429 views
Context Free language sample question
Give a context-free grammar for each of the following languages. Consider, Σ={0,1}.A. The language of strings that start with 1B. The language of strings of the form WWR ...
1 1 vote
1 1 answer
732
732 views
practicalmetal asked Mar 20, 2023
732 views
Context Free Language
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