0 votes
1 answer
1
$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?
0 votes
1 answer
2
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?
0 votes
1 answer
3
Is the diagonalization language (Ld) countable?
0 votes
1 answer
4
Where can I get the solution manual for An Introduction to Formal Languages and Automata by peter linz for the back exercises?
0 votes
2 answers
5
1 votes
1 answer
6
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 votes
1 answer
7
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
0 votes
1 answer
8
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...
0 votes
2 answers
10
Can the header length of IPV4 change at the router? If yes, then why?