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
#GATEBOOK Qno.9
rajesh170293
asked
in
Algorithms
Feb 1, 2017
200
views
–1
vote
–1
vote
http://thegatebook.in/qa/1363
rajesh170293
asked
in
Algorithms
Feb 1, 2017
by
rajesh170293
200
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
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
392
views
#Gatebook Qno.26
There is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products, left recursion,). What would be the max number of productions if that gets converted into GNF (A). 2 (B). <=4 (C). <=8 (D). None
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
by
Hradesh patel
392
views
theory-of-computation
test-series
0
votes
0
votes
1
answer
2
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
263
views
#Gatebook Qno.25
Here is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products). What would be the max number of productions if that gets converted into CNF (A). 2 (B). <=4 (C). <=8 (D). None
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
by
Hradesh patel
263
views
theory-of-computation
test-series
1
vote
1
vote
0
answers
3
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
274
views
#Gatebook qno.-23
Let M be a single-tape deterministic TM with tape alphabet { blank, 0, 1 }, and let C denote the ( possibly infinite ) computation of M starting with a blank tape. The input to each problem is M, together with a positive integer n. Which of the following problems is(are) ... tape cells during the company C (A). III only (B). I and II only (C).I and III only (D).I,II and III
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
by
Hradesh patel
274
views
theory-of-computation
test-series
0
votes
0
votes
0
answers
4
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
220
views
#Gatebook Qno-16
L = {B(N)#B(N+1) : B(N) represents binary pattern for given N. Example B(5)=101, N>=1}. Then which of the following is true for L? (A). L is regular (B). L is CFL but not regular (C). L is Recursive but not CFL (D). L is recursive enumerable but not recursive
Hradesh patel
asked
in
Theory of Computation
Nov 20, 2016
by
Hradesh patel
220
views
theory-of-computation
test-series
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
