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
Questions by adwaitLP
2
votes
1
answer
1
Decidable or undecidable
If M is a turing machine and Language accepted by that turning machine is L(M) such that L is regular language. Whether this Statement is decidable or undecidable?
If M is a turing machine and Language accepted by that turning machine is L(M) such that L is regular language. Whether this Statement is decidable or undecidable?
2.2k
views
asked
Sep 13, 2017
Theory of Computation
turing-machine
decidability
regular-language
+
–
0
votes
1
answer
2
How Finite automata is considered as Turing machine with a restricted tape length?
How Finite automata is considered as Turing machine with a restricted tape length?
How Finite automata is considered as Turing machine with a restricted tape length?
324
views
asked
Sep 11, 2017
Theory of Computation
turing-machine
finite-automata
+
–
2
votes
1
answer
3
How (a*b*)* generates 'ba' substring.
In Regular Expressions I saw (a+b)* = (a*b*)* Now my question is how (a*b*)* is able to generate 'ba' string (or any string in which 'a' comes after 'b')
In Regular Expressions I saw (a+b)* = (a*b*)*Now my question is how (a*b*)* is able to generate 'ba' string (or any string in which 'a' comes after 'b')
1.0k
views
asked
Aug 29, 2017
Theory of Computation
regular-expression
+
–
2
votes
0
answers
4
Very basic C language doubt regarding printf("\5");
Very basic C language doubt regarding \5 #include <stdio.h> int main() { printf("\5"); return 0; } why the output of this code is ♣??
Very basic C language doubt regarding \5 #include <stdio.h int main() { printf("\5"); return 0; }why the output of this code is ♣??
1.2k
views
asked
Oct 10, 2016
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register