2 votes
1
0 votes
3
Consider the following languages :L1 : Set of all strings of form {apbqp + q = 500} over alphabet Σ = {a, b}.L2 : Set of all strings of form {apbqp – q = 500} ov...
0 votes
4
L={a^n b^k, n <= k <=2n}1.CFL2.Non CFL
1 votes
5
1. L={an bm where n!=m and m,n>=0} .Is it an DCFL, CFL ?
1 votes
6
When it is mentioned that at slow start MSS=2...in congestion avoidance phase do we need to keep adding 2 or 1 ?.Suppose initial Mss=2...threshold=8..then2,4,8,9,10 will ...
3 votes
7
0 votes
8
0 votes
10