Register

REGULAR LANGUAGES

806 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · DYNAMIC PROGRAMMINGNext → · PROGRAMMING
← Previous in category · left recursionNext in category → · DCFL, LR(k), 2DFA
Position:
Show:

Related questions

2 2 votes
1 1 answer
2.4k
2.4k views
rahuljai asked Dec 13, 2018
2,416 views
TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n 0 }L = {a^nb^n | n < 1000 }L = {a^nb^k | n is odd or k is even }L = {wxw^R | w,x ∈(0+1)* }1, 3 and...
1 1 vote
2 2 answers
2.1k
2.1k views
vishal8492 asked Dec 6, 2016
2,143 views
Regular Expression to CFG
So , 1 is mandatory in Regular expression ; and both of above grammar allows strings without 1 to be genearated.So , I expected None of above to be answer. What Am I mis...
5 5 votes
6 answers 6 answers
1.8k
1.8k views
Rakesh K asked Nov 27, 2016
1,795 views
Regular Languages
If L1 contains finite number of strings and L2 is a CFL then $L1\cap L2$ is ____(A) Regular(B) CSL(C) CFL(D) None of these
3 3 votes
2 2 answers
323
323 views
Mr_Soprano asked Jul 5, 2025
323 views
Regular Languages
Can someone provide a formal proof for such questions?