Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by abby murali
3
answers
1
How is the complement of Language L is Context free ??
The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular (b) context free (c) context sensitive but not context free (d) recursive and not a cfl.
The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular(b) context free(c) context sensitive but not context free(d) recursi...
7.3k
views
commented
Sep 19, 2016
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
10
answers
2
GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored ...
22.6k
views
comment edited
May 11, 2016
Databases
gateit-2006
databases
sql
normal
+
–
1
answer
3
TIFR CSE 2010 | Part B | Question: 40
Which of the following statement is FALSE? All recursive sets are recursively enumerable. The complement of every recursively enumerable sets is recursively enumerable. Every Non-empty recursively enumerable set is the range of some totally recursive function. All finite sets are recursive. The complement of every recursive set is recursive.
Which of the following statement is FALSE?All recursive sets are recursively enumerable.The complement of every recursively enumerable sets is recursively enumerable.Ever...
2.5k
views
commented
Dec 18, 2015
Theory of Computation
tifr2010
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
2
answers
4
TIFR CSE 2012 | Part B | Question: 19
Which of the following statements is TRUE? Every turning machine recognizable language is recursive. The complement of every recursively enumerable language is recursively enumerable. The complement of a recursive language is recursively enumerable. The ... . The set of turning machines which do not halt on empty input forms a recursively enumerable set.
Which of the following statements is TRUE?Every turning machine recognizable language is recursive.The complement of every recursively enumerable language is recursively ...
2.9k
views
comment edited
Dec 17, 2015
Theory of Computation
tifr2012
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
1
answer
5
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...
1.3k
views
commented
Dec 15, 2015
Theory of Computation
theory-of-computation
difficult
virtual-gate-test-series
+
–
2
answers
6
GATE CSE 2007 | Question: 31
Which of the following languages is regular? $\left\{ww^R \mid w \in \{0, 1\}^+\right\}$ $\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$ $\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$ $\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$
Which of the following languages is regular?$\left\{ww^R \mid w \in \{0, 1\}^+\right\}$$\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$$\left\{wxw^R \mid x, w \in \{0, 1\}...
14.3k
views
comment edited
Dec 3, 2015
Theory of Computation
gatecse-2007
theory-of-computation
normal
regular-language
+
–
1
answer
7
Given that a language LA = L1 U L2,
Given that a language $L_A = L_1 \cup L_2$, where $L_1$ and $L_2$ are two other languages. If $L_A$ is known to be a regular language, then which of the following statements is necessarily TRUE? If $L_1$ is regular then $L_2$ will also be ... finite then $L_2$ will be regular If $L_1$ is regular and finite then $L_2$ will also be regular and finite None of these
Given that a language $L_A = L_1 \cup L_2$, where $L_1$ and $L_2$ are two other languages. If $L_A$ is known to be a regular language, then which of the following stateme...
4.7k
views
commented
Nov 30, 2015
Theory of Computation
theory-of-computation
regular-language
normal
+
–
2
answers
8
The Solution to the recurrence is :
575
views
commented
Nov 25, 2015
Algorithms
algorithms
recurrence-relation
test-series
+
–
3
answers
9
Master theorem details?
There are different versions of master theorem available. I want to know whether the version given in Cormen book is sufficient for GATE?
There are different versions of master theorem available. I want to know whether the version given in Cormen book is sufficient for GATE?
2.8k
views
answered
Nov 17, 2015
Algorithms
algorithms
master-theorem
+
–
1
answer
10
Draw NFA.
1) Design an NFA with no more than $5$ states for: $L_1 = \left \{aba b^n \mid n \geq 0 \right \} \cup \left \{ ab a^n \mid n\geq 0 \right \}$ 2) Design an NFA with $3$ ... $4$ states for: $L_3= \left \{ a^n \mid n\geq 0 \right \} \cup \left \{b^n a \mid n \geq 1 \right \}$
1) Design an NFA with no more than $5$ states for: $$L_1 = \left \{aba b^n \mid n \geq 0 \right \} \cup \left \{ ab a^n \mid n\geq 0 \right \}$$2) Design an NFA with $3$ ...
729
views
commented
Nov 12, 2015
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
11
no of states in minimal dfa
Q no. of states in minimal DFA built for: accepts all strings over the alphabet {0,1} interpreted as a binary number is congruent to zero modulo n has a)n states b)n-1 states c)n+1 states d)None of the above basically, i didn't get what they are trying to say in this question?(correct answer is option A)
Qno. of states in minimal DFA built for:accepts all strings over the alphabet {0,1} interpreted as a binary number is congruent to zero modulo n hasa)n statesb)n-1 states...
4.6k
views
commented
Nov 11, 2015
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
2
answers
12
Binary Number when interpreted as decimal mod 12
What are the Number of states in minimum DFA that accepts Binary strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.
What are the Number of states in minimum DFA that accepts Binary strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.
1.4k
views
answer edited
Nov 7, 2015
Theory of Computation
minimal-state-automata
theory-of-computation
+
–
4
answers
13
Which of the language accepted by the following PDA ??
3.6k
views
answered
Nov 3, 2015
Theory of Computation
theory-of-computation
context-free-language
+
–
2
answers
14
equal number of sequence, is language regular ?
L1= Set of all strings having equal number of 00 and 11. L2= Set of all strings having equal number of 01 and 10. (a) Both are Regular (b) Both are Context-Free (c) L1 is regular, L2 is Context Free (d) L1 is CF, L2 is Regular
L1= Set of all strings having equal number of 00 and 11.L2= Set of all strings having equal number of 01 and 10.(a) Both are Regular (b) Both are Context-Free(c) L1 is re...
6.7k
views
commented
Oct 31, 2015
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
15
Are these DCFL? Why ?
1) $a^{n}b^{n} \cup a^{n}b^{2n} ; n\geq 0$ 2) $a^{n}cb^{n} \cup a^{n}db^{2n} ; n\geq 0$ 3)$ca^{n}b^{n} \cup da^{n}b^{2n} ; n\geq 0$
1) $a^{n}b^{n} \cup a^{n}b^{2n} ; n\geq 0$2) $a^{n}cb^{n} \cup a^{n}db^{2n} ; n\geq 0$3)$ca^{n}b^{n} \cup da^{n}b^{2n} ; n\geq 0$
1.9k
views
commented
Oct 20, 2015
Theory of Computation
theory-of-computation
+
–
1
answer
16
give explanation..???
674
views
commented
Oct 16, 2015
Theory of Computation
context-free-language
+
–
1
answer
17
How can we say r* and r+ may be equal?? Is it correct?
How can we say r* and r+ may be equal?? Is it correct?
How can we say r* and r+ may be equal?? Is it correct?
1.3k
views
commented
Oct 15, 2015
7
answers
18
GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$
The number of tokens in the following C statement isprintf("i=%d, &i=%x", i, &i);$3$$26$$10$$21$
36.8k
views
commented
Oct 13, 2015
Compiler Design
gatecse-2000
compiler-design
lexical-analysis
easy
isro2015
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register