Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by mb14
0
votes
1
Databases
Somebody please verify the answer
Somebody please verify the answer
405
views
answered
Jul 8, 2022
Databases
databases
made-easy-test-series
database-normalization
+
–
0
votes
2
Doubt
Are NULL productions in the form of S->ɛ allowed in CFG and regular grammar?
Are NULL productions in the form of S->ɛ allowed in CFG and regular grammar?
618
views
answered
Aug 29, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
3
Recognize language
$L_1$ =${a^nb^nc^n|n\geq 2}$ $L_2$=${a^nb^mc^k|n,m,k\geq 0}$ $L_3$=$L_1.(L_2)^*$ ,then $L_3$ is Regular CFL Csl None
$L_1$ =${a^nb^nc^n|n\geq 2}$$L_2$=${a^nb^mc^k|n,m,k\geq 0}$$L_3$=$L_1.(L_2)^*$ ,then $L_3$ isRegularCFLCslNone
679
views
answered
Jun 4, 2018
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register