Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
utkarshkosta
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by utkarshkosta
1
votes
1
answer
1
Decidability
Let L be a DCFL and R is a regular language. Consider the below given problems. P : Is L ≠ R? Q : is R ⊂ L? Choose the correct option. Both problems P and Q are decidable. Both problems P and Q are undecidable. Problem Q is decidable and P is ... DCFL's, i.e when both languages are DCFL's. How do I analyze decidablity for different languages? In this case, for a RL and DCFL.
Let L be a DCFL and R is a regular language. Consider the below given problems.P : Is L ≠ R?Q : is R ⊂ L?Choose the correct option.Both problems P and Q are decidable...
1.6k
views
asked
Jan 9, 2019
Theory of Computation
decidability
theory-of-computation
+
–
0
votes
0
answers
2
Programming and DS
#include<stdio.h> int main() { char A[5][7][6]; char *p[5][7][6]; printf(“%d\t”,(unsigned)(A+1)-(unsigned)A); printf(“%d”,(unsigned)(p+1)-(unsigned)p); } OPTIONS: 42 42 1 1 42 336 336 42
#include<stdio.h int main() { char A[5][7][6]; char *p[5][7][6]; printf(“%d\t”,(unsigned)(A+1)-(unsigned)A); printf(“%d”,(unsigned)(p+1)-(unsigned)p); } OPTIONS:4...
364
views
asked
Dec 22, 2018
Programming in C
data-structures
programming-in-c
output
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register