Register

REGULAR LANGUAGES

580 views

1 Answer

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

Related questions

2 votes
2 votes
1 answer
1
rahuljai asked Dec 13, 2018
1,065 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 4 2, 3, 4 2, 3 1, 2, 3, 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 a...
User Avatar
1 votes
1 votes
2 answers
2
vishal8492 asked Dec 6, 2016
1,728 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 missing here ? Consider for (A) Production = A0 -> A1 A1-> 0
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...
User Avatar
5 votes
5 votes
6 answers
3
Rakesh K asked Nov 27, 2016
967 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
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
User Avatar
0 votes
0 votes
2 answers
4
Abhipsa asked Jan 21, 2019
1,528 views
Regular Languages
Is this language regular? If yes, how? L = {wxwR | x, w ϵ {0, 1}*} wR is reverse of string w. Thank you!
Is this language regular? If yes, how?L = {wxwR | x, w ϵ {0, 1}*}wR is reverse of string w. Thank you!
User Avatar
Link Copied!