Recent questions tagged theory-of-computation

0 votes
0 answers
91
L = a^n / n is odd number is a Regular languagebut by checking it with pumping lemma it’s getting as Not Regular.why?https://gateoverflow.in/?qa=blob&qa_blobid=158721...
0 votes
1 answer
92
0 votes
1 answer
93
0 votes
1 answer
94
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
1 votes
2 answers
98
$L_1=a^ * b^ *$$L_2=a^ + b^ +$Find $L_2-L_1$:A. $a ^ *$B. $b ^ *$C. $a ^ * +b^ *$D. None
0 votes
1 answer
99
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following:Which one of them is correct ?
0 votes
1 answer
100
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
0 votes
2 answers
101
0 votes
0 answers
102
0 votes
1 answer
103
L = (a+b)$\small ^*$b is equivalent to ____________?A. (ab$\small^*$)$\small^+$B. (a$\small^+$b$\small^*$)$\small^+$C. b$\small^*$(ab$\small^*$)$\small^*$bD. None
1 votes
1 answer
104