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 target2017
2
votes
61
CFL or DCFL or Not CFL
Which are DCFL, CFL, or not CFL 1. ambnck 2. ambnck | m=n or n=k if m=even then m=k 3. ambnck | if m=n then n=k
Which are DCFL, CFL, or not CFL1. ambnck2. ambnck | m=n or n=k if m=even then m=k3. ambnck | if m=n then n=k
4.7k
views
answered
Dec 1, 2016
Theory of Computation
theory-of-computation
+
–
0
votes
62
GATE CSE 1989 | Question: 4-ix
Explain the behaviour of the following logic circuit with level input $A$ and output $B$.
Explain the behaviour of the following logic circuit with level input $A$ and output $B$.
3.0k
views
answered
Dec 1, 2016
Digital Logic
gate1989
descriptive
digital-logic
circuit-output
+
–
0
votes
63
process synchronisation
759
views
answered
Dec 1, 2016
1
votes
64
Aptitude
A with the help of a son can do a work in 10days . They start together and after 6 days his son left the work . Then remaining work will be done by A in 8 days . Then A alone would do work in how many days ? verify please :)
A with the help of a son can do a work in 10days . They start together and after 6 days his son left the work . Then remaining work will be done by A in 8 days . Then A a...
344
views
answered
Nov 25, 2016
Quantitative Aptitude
quantitative-aptitude
+
–
2
votes
65
context free grammar
Is L2 same as a^i b^j c^j , i,j >=0?
Is L2 same as a^i b^j c^j , i,j >=0?
2.8k
views
answered
Nov 21, 2016
Theory of Computation
theory-of-computation
context-free-grammar
+
–
3
votes
66
minimised Automata
Let $L=\{(a^p)^* \mid$ p is a prime number$\}$ and $\Sigma=\{a\}$ .The minimum number of states in NFA that accepts $L$ is?
Let $L=\{(a^p)^* \mid$ p is a prime number$\}$ and $\Sigma=\{a\}$ .The minimum number of states in NFA that accepts $L$ is?
682
views
answered
Nov 21, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
67
made eady TS
Q. consider L1 is reducible to L2 and L2 is reducible to L3 . which of the following can be valid the above language of L1 and L2?? a) L1 Ռ L2 is decidable b) complement of L1 is undecidable c) homomorphism of L1 is decidable d) none ... same L1 is decidable and decidable closed under intersection so option A is correct if going to option checking plz expalin which method is correct??
Q. consider L1 is reducible to L2 and L2 is reducible to L3 . which of the following can be valid the above language of L1 and L2??a) L1 Ռ L2 is decidableb) complement o...
476
views
answered
Nov 20, 2016
1
votes
68
GATE CSE 1987 | Question: 13-a
The below figure shows four $\text{D}$-type flip-flops connected as a shift register using a $\text{XOR}$ ... $Q_{A} Q_{B} Q_{C} Q_{D}$ after the fourth clock pulse is $0000$ $1111$ $1001$ $1000$
The below figure shows four $\text{D}$-type flip-flops connected as a shift register using a $\text{XOR}$ gate. The initial state and three subsequent states for three cl...
3.7k
views
answered
Nov 17, 2016
Digital Logic
gate1987
digital-logic
circuit-output
sequential-circuit
digital-counter
shift-registers
+
–
0
votes
69
Parse trees
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse trees concluding it as ambiguous.. Only with reference to the string 'b' otherwise i know its ambiguous...
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse tr...
1.5k
views
answered
Aug 10, 2016
Theory of Computation
ambiguous
grammar
compiler-design
+
–
5
votes
70
Compiler Design LR(0) Checking
Is E --> E+T / T , T --> i is LR(0) grammar ?
Is E E+T / T , T i is LR(0) grammar ?
2.4k
views
answered
Aug 10, 2016
Compiler Design
compiler-design
grammar
lr-parser
+
–
0
votes
71
UGC NET CSE | Junet 2015 | Part 3 | Question: 63
Given the following grammars: $G_1$ $S \rightarrow AB \mid aaB$ $A \rightarrow aA \mid \epsilon$ $B \rightarrow bB \mid \epsilon$ $G_2$: $S \rightarrow A \mid B$ $A \rightarrow a A b \mid ab$ ... is unambiguous and $G_2$ is ambiguous grammars both $G_1$ and $G_2$ are ambiguous grammars both $G_1$ and $G_2$ are unambiguous grammars
Given the following grammars:$G_1$$S \rightarrow AB \mid aaB$ $A \rightarrow aA \mid \epsilon$ $B \rightarrow bB \mid \epsilon$$G_2$:$S \rightarrow A \mid B$ $A \rightarr...
4.7k
views
answered
Aug 10, 2016
Theory of Computation
ugcnetcse-june2015-paper3
theory-of-computation
compiler-design
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register