Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ldentify-language
1
votes
1
answer
1
Language produced by CFG
Consider the context free grammar below. What language does it generates? S -> 0B|1A A ->0|0S|1AA B ->1|1S|0BB
Consider the context free grammar below. What language does it generates?S - 0B|1AA ->0|0S|1AAB ->1|1S|0BB
Shweta Singh Lodhi
427
views
Shweta Singh Lodhi
asked
Oct 5, 2016
Theory of Computation
context-free-grammar
context-free-language
ldentify-language
theory-of-computation
+
–
11
votes
1
answer
2
Identify language
Consider the sets over $\left\{a,b\right\}$ $S_1=\left\{a,ab\right\};$ $S_2=\left\{b,ba\right\};$ $S_3=\left\{a^nb^{2n}\right\}\cup \left\{a^{2n}b^n\right\};$ $S_4=\left\{ww^R|w\in(a,b)^*\right\};$ ... prefix property. But, why cant they be accepted by dfa (where we dont check prefix property satisfaction). If pda was given then they would have been right, I guess.
Consider the sets over $\left\{a,b\right\}$$S_1=\left\{a,ab\right\};$$S_2=\left\{b,ba\right\};$$S_3=\left\{a^nb^{2n}\right\}\cup \left\{a^{2n}b^n\right\};$$S_4=\left\{ww^...
Tushar Shinde
2.8k
views
Tushar Shinde
asked
Jan 12, 2016
Theory of Computation
identify-class-language
finite-automata
theory-of-computation
ldentify-language
+
–
1
votes
1
answer
3
Language and its compliment
Given $(L')^* = (L^*)' where ' is complement operation. $L$ is ? $ \phi, \{\epsilon \}$ and $ \Sigma^*$ $\{\epsilon \}$ and $\Sigma^*$ $ \phi $ and $\{\epsilon \} $ $L$ is not any of $\phi, \{\ ... $\Sigma^*$ Please someone explain the meaning of ∅ and comp(∅) also. This question got me confused over the meaning of ∈ also.
Given $(L')^* = (L^*)' where ' is complement operation.$L$ is ?$ \phi, \{\epsilon \}$ and $ \Sigma^*$$\{\epsilon \}$ and $\Sigma^*$$ \phi $ and $\{\epsilon \} $$L$ is no...
Utk
574
views
Utk
asked
Jan 4, 2016
Theory of Computation
ldentify-language
finite-automata
regular-expression
+
–
1
votes
2
answers
4
Identify language generated by CFG
Consider the following grammar, $S\rightarrow aSa|bSb|A$ $A\rightarrow aBb$ $B\rightarrow aB|bB|\epsilon$ Identify the language generated by above CFG a. $L=\left\{ww^R \;|\; w\in (a+b)^* \right\}$ b. $L=\left\{xwabbw^R \;|\; w,x\in (a+b)^* \right\}$ c. $L=\left\{waxbw^R \;|\; w,x\in (a+b)^* \right\}$ d. None of these
Consider the following grammar,$S\rightarrow aSa|bSb|A$$A\rightarrow aBb$$B\rightarrow aB|bB|\epsilon$Identify the language generated by above CFGa. $L=\left\{ww^R \;|\; ...
Shefali
2.3k
views
Shefali
asked
Oct 22, 2015
Theory of Computation
theory-of-computation
ldentify-language
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register