Register

Recent questions tagged regular-language

6 votes
2 answers
547
Whether languages regular or not
L1 ={ a^pb^q | p+q>=10^6} L2= { a^mb^n | m-n>=10^6} i m not getting this can someone help me with this
L1 ={ a^pb^q | p+q>=10^6}L2= { a^mb^n | m-n>=10^6} i m not getting this can someone help me with this
User Avatar
0 votes
1 answer
551
regular grammar
Consider the following regular expressions i) (a/b)* ii) (a*/b*)* iii) ((ε / a)b*)* Which of the following equal?
Consider the following regular expressionsi) (a/b)*ii) (a*/b*)*iii) ((ε / a)b*)*Which of the following equal?
User Avatar
0 votes
1 answer
552
#finding out regular expression for given regular language
I am finding very difficulty to find out regular expression for given regular language. Kindly explain me the entire procedure to get the correct answer in minimum tume. Thanks & Regards, Kiran Watts
I am finding very difficulty to find out regular expression for given regular language. Kindly explain me the entire procedure to get the correct answer in minimum tume.T...
User Avatar
0 votes
2 answers
554
If L=(a+b)* and R=a*b*a* then L intersection R=?
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L? Correct me!
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L?Correct me!
User Avatar
0 votes
0 answers
556
virtual-gate -2015 toc
Why is the answer D? How to solve it in simple way other than learning Rice Theorem? Does anyone know Rice thm in short?
Why is the answer D? How to solve it in simple way other than learning Rice Theorem? Does anyone know Rice thm in short?
User Avatar
0 votes
1 answer
557
Virtual Gate Test Series: Theory Of Computation - Languages
Answe is B, but why is L2 not regular? How to solve it? For L2, $ y=x^{1/n}$ I am not understanding why is this not right?
Answe is B, but why is L2 not regular? How to solve it? For L2, $ y=x^{1/n}$ I am not understanding why is this not right?
User Avatar
1 votes
0 answers
561
regular lang
let l denote the language denoted by the grammer s--> 00T T-->11S/11 l=(0|1) l is regular but not (0|1) l is CFL but not regular l is not CFL
let l denote the language denoted by the grammer s 00TT >11S/11l=(0|1)l is regular but not (0|1)l is CFL but not regular l is not CFL
User Avatar
1 votes
1 answer
563
Language accepted by NFA
Consider the NFA below: The above NFA acceptes all those binary strings which represents the decimal numbers and are a. divisible by 6 only b. dividible by 2 and 3 only c. divisible by 2 or 3 d. None of these
Consider the NFA below:The above NFA acceptes all those binary strings which represents the decimal numbers and area. divisible by 6 onlyb. dividible by 2 and 3 onlyc. di...
User Avatar
0 votes
2 answers
564
Regular language.
Set of all lexical error produced by compiler is regular or not. I think it is regular,beacuse it should be finite. Plz explain if anything else.
Set of all lexical error produced by compiler is regular or not. I think it is regular,beacuse it should be finite. Plz explain if anything else.
User Avatar
24 votes
2 answers
565
Half(L)
If L is Regular Language then half (L) = {u | ∃v : | v | = | u | and uv ∊ L} is also Regular Language. Can anyone plz explain this with simple example.
If L is Regular Language thenhalf (L) = {u | ∃v : | v | = | u | and uv ∊ L} is also Regular Language.Can anyone plz explain this with simple example.
User Avatar
3 votes
2 answers
566
Regular Expression
$\begin{align*} & \color{blue}{\text{Find regular expression for the following language}} \\ \\ &L = \left \{ xwx \; |\; x,w \in \left \{ a+b \right \}^{*} , |x| \leq 4 \right \} \\ \end{align*}$
$$\begin{align*} & \color{blue}{\text{Find regular expression for the following language}} \\ \\ &L = \left \{ xwx \; |\; x,w \in \left \{ a+b \right \}^{*} , |x| \leq 4 ...
User Avatar
2 votes
1 answer
567
Regular Expression
Regular Expression for the following Language, $\begin{align*} L = \left \{ a^{m}b^{n}\; | m \geq 1,n \geq 1,mn \geq 3 \right \} \end{align*}$
Regular Expression for the following Language,$$\begin{align*} L = \left \{ a^{m}b^{n}\; | m \geq 1,n \geq 1,mn \geq 3 \right \} \end{align*}$$
User Avatar
0 votes
1 answer
570
regular Language
r1 = 1 (0 + 1)* r2 = 1 (1 + 0)+ r3 = 11*0 Relation? (a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) (b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3) (c) L (r1) ⊇ L (r2) and L(r2) ⊆ L(r3) (d) L (r1) ⊆ L (r3) and L(r2) ⊆ L(r1)
r1 = 1 (0 + 1)*r2 = 1 (1 + 0)+r3 = 11*0Relation?(a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) (b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3)(c) L (r1) ⊇ L (r2) and ...
User Avatar
Page: