0 votes
1
int fun(int n){int table={0,1,2,1,2,2,3,1,2,2,3,2,3,3,4};int count =0;for(;n;n>>4)count=count + table[n & oxf];return(count);}what will fun() return?1.returns no.of 0's i...
1 votes
4
1 votes
5
0 votes
6
How to construct NFA with even number of a's and even no of b's??
0 votes
7
draw dfa w | w is any string not in (ab+)* ?
2 votes
9
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet {a,b}, such that every string ending with five b's.
1 votes
10
P->(Q->P) IS EQUIVALENT TO ~P->(P->Q) WITHOUT USING TRUTH TABLE