1 answer
1
Where can I get the solution manual for An Introduction to Formal Languages and Automata by peter linz for the back exercises?
1 answer
2
$L=\{wa^nw^Rb^n\mid w\in \left \{ a,b \right \}^\ast ,n\geqslant 0\}$Can anyone give me step by step solution that shows this is not CFL by pumping Lemma?
1 answer
8
Is the diagonalization language (Ld) countable?
1 answer
9
If for every RE there exist a TM that accepts it, is it possible that for 2 different RE languages there exists a single TM that accepts them?
1 answer
14
I want to join the two tables of movies and actors and then output only those results that have gender =”F”, can you tell me where I am going wrong?
1 answer
22
Suppose we have a 32-bit memory and we have to representunsigned int a = -5What will the memory representation look like?000000…….1011or 111…..1011
1 answer
25
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...
3 answers
30
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$, where the data bits and the check bits...