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
Answers by abhishekmehta4u
0
votes
81
recursive language
Can a language exist which is undecidable as well as Recursive language ? If yes please give example.
Can a language exist which is undecidable as well as Recursive language ? If yes please give example.
966
views
answered
Mar 30, 2019
Theory of Computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
82
toc concept
do recursive language is recursively enumerable as well ? true or false
do recursive language is recursively enumerable as well ? true or false
327
views
answered
Mar 30, 2019
3
votes
83
Allen Career Institute:Computer Organization -Memory
The size of instruction in a single accumulator CPU organization is $16$ bits. In order to evaluate the expressions given below. How much memory space (bytes) is required for storing the program? evaluate the expression from left to right). Expression : $y=\frac{A-B+C}{E+F}$
The size of instruction in a single accumulator CPU organization is $16$ bits. In order to evaluate the expressions given below. How much memory space (bytes) is required...
736
views
answered
Mar 30, 2019
CO and Architecture
computer-organisation
+
–
4
votes
84
Self doubts
Q. The following program consists of 3 concurrent processes and 3 binary semaphore.The semaphore are initialized as s0=1, s1=0, s2=0 . Process p0 { Wait (s0); Print '0' ; Release (s1); Release (s2); } Process p1 Wait (s1 ... processes can also executes recursively so why they gives ans as "exactly" term please gives proper explanation my assumption is right or wrong?
Q. The following program consists of 3 concurrent processes and 3 binary semaphore.The semaphore are initialized as s0=1, s1=0, s2=0 .Process p0{ Wait (s0);Print '0' ;...
765
views
answered
Mar 30, 2019
Operating System
operating-system
+
–
0
votes
85
ISRO2014-33
The following Finite Automaton recognizes which of the given languages? $\{ 1, 0 \}^* \{ 0 1 \}$ $\{ 1,0\}^*\{ 1\}$ $\{ 1 \} \{1, 0\}^*\{ 1 \}$ $1^*0^*\{0,1\}$
The following Finite Automaton recognizes which of the given languages?$\{ 1, 0 \}^* \{ 0 1 \}$$\{ 1,0\}^*\{ 1\}$$\{ 1 \} \{1, 0\}^*\{ 1 \}$$1^*0^*\{0,1\}$
5.5k
views
answered
Mar 29, 2019
GATE
finite-automata
isro2014
+
–
0
votes
86
IIT Patna VS IIIT Alahabad VS IIT Indore VS IIIT Banglore in terms of faculties, curriculum and placements.
2.3k
views
answered
Mar 29, 2019
2
votes
87
Self Doubt
For Language $L=\{a^{n}b^{n}|n\geq 0\}$ Design Final state PDA and Empty Stack PDA$?$ I can able to design Final state PDA, can someone explain in detail to design Empty Stack PDA$?$ I have another doubt acceptance of Final state PDA and Empty Stack PDA are the same in case of NPDA, but in case of DPDA I don’t know$?$
For Language $L=\{a^{n}b^{n}|n\geq 0\}$Design Final state PDA and Empty Stack PDA$?$I can able to design Final state PDA, can someone explain in detail to design Empty St...
901
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
easy
+
–
1
votes
88
ME OTS 1 : Finite Automata
Doubt: ( Even if we take compliment , its wont satisfy it )
Doubt: ( Even if we take compliment , its wont satisfy it )
605
views
answered
Mar 29, 2019
0
votes
89
made easy
the minimal number of states needed for DFA for below NFA
the minimal number of states needed for DFA for below NFA
192
views
answered
Mar 29, 2019
0
votes
90
c functions
#include <stdio.h> void demo() { printf("GeeksQuiz "); } int main() { demo(); return 0; } ****************************************************************************** #include <stdio.h> int main() { demo(); return 0; } void demo() { printf("GeeksQuiz "); } will both program same result?
#include <stdio.h void demo() { printf("GeeksQuiz "); } int main() { demo(); return 0; } #include <stdio.h int main() { demo(); re...
807
views
answered
Mar 29, 2019
8
votes
91
Inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous? (A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$ (B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$ ... (D) Both (B) and (C) Plz explain.. ..........Is there any criteria on the basis of which we could identify inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous?(A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$(B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$(C)...
15.6k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
3
votes
92
How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance
Is there any procedure to generalize these types of problems ? Thanks in advance
16.4k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
combinatory
finite-automata
number-of-dfa
+
–
0
votes
93
Question of regular expression
Consider the following regular expressions : (i) ($(a/b)^{*}$ (ii) $(a^{*}/b^{*})^{*}$ (iii) $((\epsilon /a)b^{*})^{*}$ Which of the following statements are correct ? (a) (i) ,(ii) are equal and (ii) , (iii) are not . (b) (i) ,(ii) are equal and ( ... me (a)* . Isn't it so ? From (i) ($(a/b)^{*}$ : I can not separate a and b . So , how can they all be equal ?
Consider the following regular expressions :(i) ($(a/b)^{*}$ (ii) $(a^{*}/b^{*})^{*}$ (iii) $((\epsilon /a)b^{*})^{*}$Which of the following statements are correct ?...
6.2k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
94
Question on Regular expression - 2
Answer given as : e But , my question is (P*Q*) * = {null string , any number of P , any number of Q , P followed by Q , } whereas (P*+Q*)* = { null string , any number of P , any number of Q , P followed by Q , Q followed by P } So , in the (P*Q*)* , Q followed by P is not possible . So , how they can be equal ?
Answer given as : e But , my question is (P*Q*) * = {null string , any number of P , any number of Q , P followed by Q , }whereas (P*+Q*)* = { null string , any number of...
2.8k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
+
–
1
votes
95
Which of the the languages are CFL ( and not )
Q 1. My answer is (c) all are CFL , as in case of L1 , we can break it as an am c2m c2n : so we can compare using a stack in case of L2 , we can compare either of them , so it is CFL In case of L3 , it can also be resolved using a ... Here in the question , S->aS | bS | a | b , my answer is (a+b)+ (b). Am I correct in solving these questions ?
Q 1.My answer is (c) all are CFL , as in case of L1 , we can break it as an am c2m c2n : so we can compare using a stackin case of L2 , we can compare either of them , ...
1.2k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
+
–
1
votes
96
Which of the the languages are CFL ( and not )
Q 1. My answer is (c) all are CFL , as in case of L1 , we can break it as an am c2m c2n : so we can compare using a stack in case of L2 , we can compare either of them , so it is CFL In case of L3 , it can also be resolved using a ... Here in the question , S->aS | bS | a | b , my answer is (a+b)+ (b). Am I correct in solving these questions ?
Q 1.My answer is (c) all are CFL , as in case of L1 , we can break it as an am c2m c2n : so we can compare using a stackin case of L2 , we can compare either of them , ...
1.2k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
+
–
1
votes
97
Is it possible to build a Regular grammar for ( a^m a^n b^m c^n ) ?
4.4k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
+
–
0
votes
98
If a Finite state machine that accepts a set, has no loop...eg: accepts only 101. Is it the set regular? does it have the PUMPING LEMMA property?(If it is regular but has no loops)
616
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
pumping-lemma
regular-language
+
–
1
votes
99
proper non empty substrings
The maximum no of proper non empty sub-strings for the given 'n' length string is: A) n*(n+1)/2 - 1 B) n*(n+1)/2 C) n*(n+1)/2 + 1 D) none of the above I basically want a good explanation here for whatever option you choose???thanks in advance . <answer given as per coaching book is B>
The maximum no of proper non empty sub-strings for the given 'n' length string is:A) n*(n+1)/2 - 1B) n*(n+1)/2C) n*(n+1)/2 + 1D) none of the aboveI ba...
2.2k
views
answered
Mar 29, 2019
Theory of Computation
theory-of-computation
+
–
3
votes
100
Allen Career Institute:Graph Theory
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
346
views
answered
Mar 28, 2019
Graph Theory
discrete-mathematics
+
–
9
votes
101
GATE CSE 1994 | Question: 2.10
The regular expression for the language recognized by the finite state automaton of figure is ________
The regular expression for the language recognized by the finite state automaton of figure is ________
8.8k
views
answered
Mar 28, 2019
Theory of Computation
gate1994
theory-of-computation
finite-automata
regular-expression
easy
fill-in-the-blanks
+
–
1
votes
102
GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$?$E \rightarrow xEy\mid xy$$x y \mid (x^+xyy^+...
10.5k
views
answered
Mar 28, 2019
Theory of Computation
gate1995
theory-of-computation
easy
context-free-language
+
–
6
votes
103
GATE CSE 1995 | Question: 2.24
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n > 0\right\} $ then the languages $L \cup R$ and $R$ are respectively regular, regular not regular, regular regular, not regular not regular, not regular
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n 0\right\} $ then the languages $L \cup R$ and $R$ are respectivelyregular, regularnot regular, ...
15.9k
views
answered
Mar 28, 2019
Theory of Computation
gate1995
theory-of-computation
easy
regular-language
+
–
7
votes
104
GATE CSE 1996 | Question: 1.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string).$(00)^ * (\varepsilon +0)$$(00)^*$$0^*$$0(00)^*$(i) and (ii)(ii) a...
10.2k
views
answered
Mar 28, 2019
Theory of Computation
gate1996
theory-of-computation
regular-expression
easy
+
–
3
votes
105
GATE CSE 1996 | Question: 1.9
Which of the following statements is false? The Halting Problem of Turing machines is undecidable Determining whether a context-free grammar is ambiguous is undecidable Given two arbitrary context-free grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$ Given two regular grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$
Which of the following statements is false?The Halting Problem of Turing machines is undecidableDetermining whether a context-free grammar is ambiguous is undecidableGive...
8.1k
views
answered
Mar 28, 2019
Theory of Computation
gate1996
theory-of-computation
decidability
easy
+
–
2
votes
106
GATE CSE 1996 | Question: 1.10
Let $L \subseteq \Sigma^*$ where $\Sigma = \left\{a,b \right\}$. Which of the following is true? $L = \left\{x \mid x \text{ has an equal number of } a\text{'s and }b\text{'s}\right \}$ ... $L = \left\{a^mb^n \mid m \geq 1, n \geq 1 \right \}$ is regular
Let $L \subseteq \Sigma^*$ where $\Sigma = \left\{a,b \right\}$. Which of the following is true?$L = \left\{x \mid x \text{ has an equal number of } a\text{'s and }b\text...
9.0k
views
answered
Mar 28, 2019
Theory of Computation
gate1996
theory-of-computation
normal
regular-language
+
–
2
votes
107
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one?$L_1.L_2$$L_1 \cap L...
6.3k
views
answered
Mar 28, 2019
Theory of Computation
gate1996
theory-of-computation
context-free-language
easy
+
–
0
votes
108
GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...
19.3k
views
answered
Mar 28, 2019
Theory of Computation
gatecse-2012
finite-automata
easy
theory-of-computation
+
–
0
votes
109
Identify the class of L
Consider $L_1 = \left\{a^nb^nc^md^m \mid m,n \ge 1\right\}$ $L_2 = \left\{a^nb^n \mid n \ge1\right\}$ $L_3 = \left\{(a+b)^*\right\}$ Intersection of $L_1$ and $L_2$ is (A) Regular (B) CFL but not regular (C) CSL but not CFL (D) None of these
Consider$L_1 = \left\{a^nb^nc^md^m \mid m,n \ge 1\right\}$$L_2 = \left\{a^nb^n \mid n \ge1\right\}$$L_3 = \left\{(a+b)^*\right\}$Intersection of $L_1$ and $L_2$ is(A) Reg...
717
views
answered
Mar 28, 2019
Theory of Computation
theory-of-computation
normal
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
33
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register