Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
asterixbachman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by asterixbachman
1
votes
2
answers
1
Turing Recognizable and Turing Decidable
Caption Can someone give a clear explanation to this answer?
CaptionCan someone give a clear explanation to this answer?
689
views
asked
Jan 25, 2017
Theory of Computation
turing-machine
theory-of-computation
decidability
+
–
3
votes
1
answer
2
L = { 0n+m 1n+m 0m | n, m >= 0 } CSL or RE?
$L = \{ 0^{n+m }1^{n+m} 0^m \mid n, m \geq 0 \}$ The above language is (a) CFL but not Regular (b) CSL but not CFL (c) RE but not CSL (d) None of the above I thought the answer would be (b) CSL but not CFL but it was given as (c) RE but not CSL Can anyone explain how?
$L = \{ 0^{n+m }1^{n+m} 0^m \mid n, m \geq 0 \}$The above language is (a) CFL but not Regular(b) CSL but not CFL(c) RE but not CSL(d) None of the aboveI thought the answe...
2.8k
views
asked
Jan 16, 2017
Theory of Computation
theory-of-computation
identify-class-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register