Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate+theory-of-computation
1
votes
1
answer
41
Virtual Gate Test Series: Theory Of Computation - Regular Languages
Hradesh patel
361
views
Hradesh patel
asked
Oct 6, 2016
Theory of Computation
theory-of-computation
regular-language
virtual-gate-test-series
+
–
2
votes
2
answers
42
Virtual Gate Test Series: Theory Of Computation - Decidability
Here My explanation is : I. We run TM for 1,2,3,4,5....n if it stops in any of these then yes otherwise no II. We run TM for n steps if it stops yes otherwise no III. We run TM for n, n+1, n+2.... ... can say yes but if do not halt we can't say anything because we have to run it infinite number of times Is my explanation correct?
Here My explanation is :I. We run TM for 1,2,3,4,5....n if it stops in any of these then yes otherwise noII. We run TM for n steps if it stops yes otherwise noIII. We run...
Sumit1311
872
views
Sumit1311
asked
Jan 22, 2016
Theory of Computation
theory-of-computation
turing-machine
decidability
virtual-gate-test-series
+
–
1
votes
1
answer
43
CMI2011-A-09
You have a laptop with a fixed amount of memory and hard disk space and no external storage devices connected (CD, USB drives, . . . ). Which of the following is the most accurate formal model of your laptop? Turing machine Linear bounded automaton Pushdown automaton Finite state automaton
You have a laptop with a fixed amount of memory and hard disk space and no external storage devices connected (CD, USB drives, . . . ). Which of the following is the most...
go_editor
1.1k
views
go_editor
asked
May 19, 2016
Theory of Computation
cmi2011
theory-of-computation
context-sensitive
non-gate
+
–
3
votes
1
answer
44
Virtual Gate Test Series: Theory Of Computation - Arbitrary Languages
Let $L_1$ and $L_2$ be two arbitrary languages, choose incorrect statement(s) $\text{if}\; L_1.L_2\;\text{ is regular then }L_2.L_1\;\text{ is also regular.}$ ... (\ denotes set difference) Only (i) (i) and (ii) (ii) and (iii) All
Let $L_1$ and $L_2$ be two arbitrary languages, choose incorrect statement(s)$\text{if}\; L_1.L_2\;\text{ is regular then }L_2.L_1\;\text{ is also regular.}$$L_1 = L_2 \;...
sourav.
742
views
sourav.
asked
Feb 3, 2016
Theory of Computation
theory-of-computation
identify-class-language
virtual-gate-test-series
+
–
0
votes
1
answer
45
Virtual Gate Test Series: Theory Of Computation - Decidable Language
$L$ is surely decidable if (A) both $L$ and its complement are not recognizable (B) $L \subseteq \{0\}^*$ (C) $L \leq_m \{0^n1^n\;\mid\;n\geq0\}$ (D) $L^R$ is decidable
$L$ is surely decidable if (A) both $L$ and its complement are not recognizable (B) $L \subseteq \{0\}^*$(C) $L \leq_m \{0^n1^n\;\mid\;n\geq0\}$(D) $L^R$ is decidable
learncp
843
views
learncp
asked
Jan 26, 2016
Theory of Computation
theory-of-computation
decidability
virtual-gate-test-series
+
–
0
votes
1
answer
46
Virtual Gate Test Series: Theory Of Computation - Undecidability
sourav.
348
views
sourav.
asked
Feb 3, 2016
Theory of Computation
theory-of-computation
decidability
virtual-gate-test-series
+
–
9
votes
1
answer
47
Virtual Gate Test Series: Theory Of Computation - Regular and CFL Languages
Let $Σ = \{a, b, c\}$. Which of the following statements is true? For any $A ⊆ Σ^*$, if $A$ is regular, then so is $\{xx \mid x ∊ A\}$ For any $A ⊆ Σ^*$, if $A$ is regular, then so is $\{x \mid xx ∊ A\}$ ... so is $\{xx \mid x ∊ A\}$ For any $A ⊆ Σ^*$, if $A$ is context-free, then so is $\{x \mid xx ∊ A\}$
Let $Σ = \{a, b, c\}$. Which of the following statements is true?For any $A ⊆ Σ^*$, if $A$ is regular, then so is $\{xx \mid x ∊ A\}$For any $A ⊆ Σ^*$, if $A$ is...
gatecse
1.3k
views
gatecse
asked
Aug 7, 2014
Theory of Computation
theory-of-computation
difficult
virtual-gate-test-series
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
