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
MadeEasy Test Series 2018: Theory of Computation - Non Determinism
Sukhdip Singh
asked
in
Theory of Computation
Jan 17, 2018
edited
Mar 5, 2019
by
ajaysoni1924
353
views
1
vote
1
vote
isn't the ans is 3 i.e p,q,r
theory-of-computation
non-determinism
made-easy-test-series
madeeasy-testseries-2018
Sukhdip Singh
asked
in
Theory of Computation
Jan 17, 2018
edited
Mar 5, 2019
by
ajaysoni1924
by
Sukhdip Singh
353
views
answer
comment
Follow
share this
share
2 Comments
by
saxena0612
commented
Jan 17, 2018
reply
Follow
share this
Yes ! Correct answer is $3$ i think they have omitted $'p'$ which should also be included.
0
0
by
Sukhdip Singh
commented
Jan 17, 2018
reply
Follow
share this
thanks!!
0
0
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
3
votes
3
votes
0
answers
1
Sukhdip Singh
asked
in
Theory of Computation
Jan 16, 2018
592
views
MadeEasy Test Series 2018: Theory of Computation - Decidability
Consider the following statements: S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’. S2 : Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?
Sukhdip Singh
asked
in
Theory of Computation
Jan 16, 2018
by
Sukhdip Singh
592
views
made-easy-test-series
theory-of-computation
decidability
madeeasy-testseries-2018
4
votes
4
votes
0
answers
2
Bhavya Bhatia
asked
in
Theory of Computation
Jan 11, 2018
2,389
views
MadeEasy Test Series 2018: Theory of Computation - Turing Machine
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5} Which of the following is true? (A) Decidable and REC (B) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE
Bhavya Bhatia
asked
in
Theory of Computation
Jan 11, 2018
by
Bhavya Bhatia
2.4k
views
theory-of-computation
turing-machines
decidability
madeeasy-testseries-2018
3
votes
3
votes
1
answer
3
ashish pal
asked
in
Set Theory & Algebra
Jan 12, 2018
1,451
views
MadeEasy Test Series 2018: Set Theory & Algebra- Lattice
Consider statements: S1 : A finite lattice is always bounded. S2 : Complemented lattice is a proper subset of bounded lattice. S3 : A bounded and complemented lattice may or may not be a distributive lattice. Which of the following is/are ... D as per the solution my doubt is a lattice can be semi bounded and not Bounded then why S1 is true.
ashish pal
asked
in
Set Theory & Algebra
Jan 12, 2018
by
ashish pal
1.5k
views
made-easy-test-series
set-theory&algebra
lattice
madeeasy-testseries-2018
8
votes
8
votes
2
answers
4
kapilbk1996
asked
in
Graph Theory
Jan 11, 2018
755
views
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
kapilbk1996
asked
in
Graph Theory
Jan 11, 2018
by
kapilbk1996
755
views
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
