1 answer
2
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?
1 answer
4
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')
0 answers
5
Very basic C language doubt regarding \5 #include <stdio.h int main() { printf("\5"); return 0; }why the output of this code is ♣??