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
UGC NET CSE | January 2017 | Part 3 | Question: 62
go_editor
asked
in
Theory of Computation
Feb 1, 2017
recategorized
Jun 25, 2022
by
Lakshman Patel RJIT
706
views
0
votes
0
votes
Which of the following pairs have different expressive power?
Single-tape-turing machine and multi-dimensional turing machine
Multi-tape-turing machine and multi-dimensional turing machine
Deterministic push down automata and non-deterministic push down automata
Deterministic finite automata and non-deterministic finite automata
ugcnetcse-jan2017-paper3
theory-of-computation
turing-machine
go_editor
asked
in
Theory of Computation
Feb 1, 2017
recategorized
Jun 25, 2022
by
Lakshman Patel RJIT
by
go_editor
706
views
answer
comment
Follow
share this
share
1 comment
by
Kaushik.P.E
commented
Feb 1, 2017
reply
Follow
share this
UGC questions are either too complicated or too easy :-)
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
4
Answers
0
votes
0
votes
Best answer
Option C) Deterministic push down automata and non-deterministic push down automata :-)
Kaushik.P.E
answered
Feb 1, 2017
selected
Feb 2, 2017
by
Debasmita Bhoumik
by
Kaushik.P.E
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
Option C is correct. Because there are some NPDAs for which a DPDA is not availabe.
dipanjan
answered
Jun 8, 2020
by
dipanjan
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
power of NPDA > power of DPDA
correct ans would be c
Pallav98
answered
Aug 1, 2020
by
Pallav98
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
Option C is correct , NPDA is more powerful than DPDA.
Sanandan
answered
Oct 3, 2020
by
Sanandan
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
C
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
5
answers
1
go_editor
asked
in
Theory of Computation
Mar 24, 2020
875
views
UGC NET CSE | January 2017 | Part 3 | Question: 19
Which of the following are not regular? Strings of even number of a’s Strings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s. Strings of a’s whose length is a perfect square. (a) and (b) only (a), (b) and (c) only (b),(c) and (d) only (b) and (d) only
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
875
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
1
vote
1
vote
7
answers
2
go_editor
asked
in
Theory of Computation
Mar 24, 2020
719
views
UGC NET CSE | January 2017 | Part 3 | Question: 20
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$? $\{\in \}$ $\{\in,1\}$ $\phi$ $1^{\ast}$
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
719
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
2
votes
2
votes
6
answers
3
go_editor
asked
in
Theory of Computation
Mar 24, 2020
1,381
views
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... ) and (b) are true (a) is true, (b) is false (a) is false, (b) is true
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
1.4k
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
0
votes
0
votes
2
answers
4
go_editor
asked
in
Theory of Computation
Mar 24, 2020
630
views
UGC NET CSE | January 2017 | Part 3 | Question: 22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ ... $\log_{K}|W \mid \leq h \leq \left (\frac{ \mid W \mid - 1}{K-1} \right)$
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
630
views
ugcnetcse-jan2017-paper3
context-free-grammar
theory-of-computation
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
@gaurav_kumar Here it is:GATE 2023 Complete...
when is next analysis starting?
This guy was just exceptional. I remember hearing...
Inspirational! Found the right Blog at the right...
That was my second attempt. I already had notes,...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
