Register

Recent questions tagged tbb-toc-2

4 votes
0 answers
2
Test by Bikram | Theory of Computation | Test 2 | Question: 29
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is _______ .
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is...
User Avatar
2 votes
1 answer
8
Test by Bikram | Theory of Computation | Test 2 | Question: 23
Match the following lists. The conditions on the language description $L = \{a^i \ b^j \ c^k\}$ ... $A:G_3, B:G_2, C:G_1$ $A:G_1, B:G_3, C:G_2$ $A:G_3, B:G_1, C:G_2$
Match the following lists.The conditions on the language description $L = \{a^i \ b^j \ c^k\}$ are given in List I and respective grammars are given in List II.$\begin{ar...
User Avatar
0 votes
1 answer
12
Test by Bikram | Theory of Computation | Test 2 | Question: 19
Which of the following statements is correct about the given Turing Machine transitions below? ... in $\Sigma ^*$. TM halts on all strings of even length. I and II II and IV II and III I , II and III
Which of the following statements is correct about the given Turing Machine transitions below?$\begin{array}{|c|c|c|c|} \hline \delta & 0 & 1 & B \\ \hline q0 & (q1,1,R) ...
User Avatar
1 votes
1 answer
19
Test by Bikram | Theory of Computation | Test 2 | Question: 12
Choose the regular expression corresponding to the given DFA : $(00 ^*1 + 11^* 0) (0 + 1) ^*$ $((11) ^* 0 + 00 ^* 1)(0 + 1) ^*$ $(11) ^* (0 ^* 1 + 1^* 0) (0 + 1) ^*$ $(11) ^* (00 ^* 1 + 10) (0 + 1) ^*$
Choose the regular expression corresponding to the given DFA :$(00 ^*1 + 11^* 0) (0 + 1) ^*$$((11) ^* 0 + 00 ^* 1)(0 + 1) ^*$$(11) ^* (0 ^* 1 + 1^* 0) (0 + 1) ^*$$(11) ^*...
User Avatar
0 votes
0 answers
21
Test by Bikram | Theory of Computation | Test 2 | Question: 10
Match the correct automation given in Y to its transition function in $X$ ... III-D, IV-F I-B, II-C, III-E, IV-A I-C, II-B, III-E, IV-F I-B, II-C, III-F, IV-D
Match the correct automation given in Y to its transition function in $X$:$\begin{array}{|l|l|} \hline {} & X & {} & Y \\ \hline I. & Q^* \Sigma \rightarrow Q & A. & \tex...
User Avatar
1 votes
1 answer
22
Test by Bikram | Theory of Computation | Test 2 | Question: 9
Consider the following transition table of DFA where $q3$ ... The number of states required to represent the same language with minimum number of states automata is _________.
Consider the following transition table of DFA where $q3$ is the final state:$\begin{array}{|c|c|c|} \hline {} & x & y \\ \hline \rightarrow q0 & q1 & q0 \\ \hline q1 & q...
User Avatar
0 votes
1 answer
23
Test by Bikram | Theory of Computation | Test 2 | Question: 8
Which of the following Regular Expression is NOT the same as the other three? $100 ( ( (00)^* (10)^* )^* 100)^*$ $100 ( ( ( 0+1) 0)^* 100 )^*$ $100 ( (00 + 10)^* 100)^*$ $100 ( ((0+1)^* 0^* )^* 100)^*$
Which of the following Regular Expression is NOT the same as the other three?$100 ( ( (00)^* (10)^* )^* 100)^*$$100 ( ( ( 0+1) 0)^* 100 )^*$$100 ( (00 + 10)^* 100)^*$$10...
User Avatar
1 votes
1 answer
25
Test by Bikram | Theory of Computation | Test 2 | Question: 6
How many states does the Minimal Finite Automata that accepts all strings of $x$'s and $z$'s (where the number of $x$'s is at least $L$) contain? $L$ states $(L+1)$ states $(L+2)$ states $(L+3)$ states
How many states does the Minimal Finite Automata that accepts all strings of $x$'s and $z$'s (where the number of $x$'s is at least $L$) contain?$L$ states$(L+1)$ states$...
User Avatar
To see more, click for the full list of questions or popular tags.