Recent questions tagged theory-of-computation

0 votes
0 answers
2582
$a^*\ \ \ and\ \ \ a*$Isn't the above two same?Let $L\ =\ aa^*,\ then\ L^+\ =\ LL^*\ =\ aa^*(aa^*)^*\ =\ aa^*a*\ =\ aa*$I couldn't understand the last and the 2nd last s...
0 votes
1 answer
2583
Give the language accepted by the above NFA and #states in DFA accepting that language is _________________
1 votes
0 answers
2584
The difference between the number of states of minimal DFA and NFA accepting binary strings with third bit as 1 is ________
1 votes
2 answers
2590
0 votes
1 answer
2593
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
1 votes
2 answers
2594
0 votes
1 answer
2595
1)S1 is regular but not S22)S2 is regular but not S13)S1 and S2 are not regular4)S1 and S2 are regular
0 votes
1 answer
2600
1 votes
1 answer
2602
0 votes
0 answers
2603
1 votes
0 answers
2604
Let L = {ambnbkdl⎪(n+k = odd) only if m = l; m, n, k, l 0}. Which of the following is true about L?1)L is CFL but not DCFL2)L is regular but not CFL3)L is DCFL but not...
0 votes
0 answers
2606
0 votes
1 answer
2608
Given L1 = (bba*baa*) and L2 = (ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given byA)bba*bB)bba*baa*C)bba*ba*D)None of these
1 votes
1 answer
2610