Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Test by Bikram | Theory of Computation | Test 1 | Question: 23
Bikram
asked
in
Theory of Computation
Nov 26, 2016
edited
Aug 20, 2019
by
Counsellor
131
views
1
vote
1
vote
PDA can be used for:
infix to postfix conversion
implementing recursive function calls
evaluating arithmetic expressions
all of the above
tbb-toc-1
Bikram
asked
in
Theory of Computation
Nov 26, 2016
edited
Aug 20, 2019
by
Counsellor
by
Bikram
131
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
4
votes
4
votes
Best answer
Ans is D, as we can write SDT for CFG that can be realized by PDA.
Correct me if iam wrong.
AnilGoudar
answered
May 11, 2017
selected
May 11, 2017
by
Bikram
by
AnilGoudar
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
2
votes
2
votes
all of the above..
Priyanka Agarwal
answered
May 11, 2017
by
Priyanka Agarwal
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
D
← Previous
Next →
← Previous in category
Next in category →
Related questions
6
votes
6
votes
2
answers
1
Bikram
asked
in
Theory of Computation
Nov 26, 2016
582
views
Test by Bikram | Theory of Computation | Test 1 | Question: 30
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is: Decidable Undecidable but semi-decidable Not even semi-decidable Indeterminable
Bikram
asked
in
Theory of Computation
Nov 26, 2016
by
Bikram
582
views
tbb-toc-1
0
votes
0
votes
1
answer
2
Bikram
asked
in
Theory of Computation
Nov 26, 2016
157
views
Test by Bikram | Theory of Computation | Test 1 | Question: 29
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an: Decidable problem Undecidable problem Cannot ascertain None
Bikram
asked
in
Theory of Computation
Nov 26, 2016
by
Bikram
157
views
tbb-toc-1
0
votes
0
votes
1
answer
3
Bikram
asked
in
Theory of Computation
Nov 26, 2016
73
views
Test by Bikram | Theory of Computation | Test 1 | Question: 28
Recursive Enumerable Languages are NOT closed under : Union Intersection Complement Homomorphism
Bikram
asked
in
Theory of Computation
Nov 26, 2016
by
Bikram
73
views
tbb-toc-1
0
votes
0
votes
1
answer
4
Bikram
asked
in
Theory of Computation
Nov 26, 2016
77
views
Test by Bikram | Theory of Computation | Test 1 | Question: 27
If $S$ and $T$ are languages over $\Sigma =\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$ respectively, then which of the following options is CORRECT? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \emptyset$
Bikram
asked
in
Theory of Computation
Nov 26, 2016
by
Bikram
77
views
tbb-toc-1
regular-expression
easy
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
the paper was easy to moderate, in this paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy