0 votes 0 votes Given statement is true or false 1. L is regular language $\Leftrightarrow$ Ǝ a regular expression without $\bigstar$ answer in detail sid1221 asked May 17, 2017 sid1221 548 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes TRUE L is regular language ⇔Ǝ a regular expression . //original expression But a regular expression with * => regular expression without * // Informally (you can take null for example) Angkit answered May 17, 2017 Angkit comment Share Follow See all 4 Comments See all 4 4 Comments reply sid1221 commented May 17, 2017 reply Follow Share not getting ... and given ans is false 0 votes 0 votes Angkit commented May 17, 2017 reply Follow Share i mean to say is we can write regular expression,for a regular language. NOw, if we write a regular expression ...like (a+b)*, then we also can derive NULL from (a+b)*. 0 votes 0 votes sid1221 commented May 17, 2017 reply Follow Share whatever you wrote now i got ...but still m not getting whats mean of statement and why it is false 0 votes 0 votes Angkit commented May 17, 2017 reply Follow Share See if a language is regular,we can write reg exp, now suppose we wrote one.................... like ab // it do not contain any * now we write another one ....................... like (ab)* // It contain * but it also can be written without * .i.e NULL BOTH cases ,can be written without * 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes As far as I think there is also the base case that is.. 1.phi 2._€ 3._a And other are 4.R1+R2 5.R1.R2 6.R1* SO BASE CASE IS NECESSARY 1,2,3 IF FRM 4,5,6 ANY ONE IS FULFILLED ITS REGULAR EXPRESSION.. SOURCE -NPTEL VIDEO IRSHAD KHAN answered May 19, 2017 IRSHAD KHAN comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes i think this statement is only one way true it is not a bidirectional statement L is a regular language it does not necessary imply that there exists a regular expression without kleen star but if a regular expression exist without kleen star it means it is finite so necessarily would be regular language therefore all over it is false statement Kaluti answered May 31, 2017 Kaluti comment Share Follow See all 0 reply Please log in or register to add a comment.