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
UPPCL 2018 AE
pream sagar
asked
in
Theory of Computation
Dec 31, 2018
91
views
0
votes
0
votes
Which of following is not NP complete
Satisfiability of any Boolean function
CNF Satisfiability Problem
DNF Satisfiability Problem
pream sagar
asked
in
Theory of Computation
Dec 31, 2018
by
pream sagar
91
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.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Lakshman Patel RJIT
asked
in
Theory of Computation
Jan 5, 2019
126
views
UPPCL AE 2018:41
The problem of finding an integral solution of a given system of integral polynomial equations has complexity: Polynomial-time Exponential-space Undecidable Exponential-time
Lakshman Patel RJIT
asked
in
Theory of Computation
Jan 5, 2019
by
Lakshman Patel RJIT
126
views
uppcl2018
theory-of-computation
decidability
0
votes
0
votes
1
answer
2
Lakshman Patel RJIT
asked
in
Theory of Computation
Jan 5, 2019
146
views
UPPCL AE 2018:28
Which of the following problems are decidable? Checking whether two regular languages are equivalent Checking whether two non-deterministic finite automata accept the same language Checking whether two context free grammars generate equivalent languages Checking whether a language of a context free grammar is ... $\text{I, II, III}$ and $\text{IV}$ $\text{I}$ and $\text{II}$ only
Lakshman Patel RJIT
asked
in
Theory of Computation
Jan 5, 2019
by
Lakshman Patel RJIT
146
views
uppcl2018
theory-of-computation
decidability
0
votes
0
votes
1
answer
3
Lakshman Patel RJIT
asked
in
Theory of Computation
Jan 5, 2019
146
views
UPPCL AE 2018:26
Which of the following languages over the alphabet $\Sigma = \{0,1\}$ is regular? $0^{n} 1^{m}$ $0^{n} 1^{m}$ where $m=n+1$ $0^{m} 1^{n}$ where $m \equiv n(\text{mod 3}).$ $\text{I}$ and $\text{III}$ $\text{III}$ and $\text{II}$ $\text{II}$ only $\text{III}$ only
Lakshman Patel RJIT
asked
in
Theory of Computation
Jan 5, 2019
by
Lakshman Patel RJIT
146
views
uppcl2018
theory-of-computation
regular-language
2
votes
2
votes
2
answers
4
gate_forum
asked
in
Compiler Design
Jan 13, 2019
469
views
UPPCL AE 2018:70
Consider the following grammar $\text{G:}$ $\text{P} \rightarrow \text{Q + R} \mid \text{Q - R} \mid \text{Q} \mid \text{R}$ $\text{Q} \rightarrow q \mid r$ $\text{R} \rightarrow r \mid s$ where $\text{P, Q,}$ and $\text{R}$ ... grammar $\text{G}$ Neither $\text{S1}$ nor $\text{S2}$ Only $\text{S1}$ Only $\text{S2}$ Both $\text{S1}$ and $\text{S2}$
gate_forum
asked
in
Compiler Design
Jan 13, 2019
by
gate_forum
469
views
uppcl2018
compiler-design
parsing
ll-parser
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
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?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy