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
made easy test series
Shankar Kakde
asked
in
Theory of Computation
Jan 26, 2019
338
views
0
votes
0
votes
Shankar Kakde
asked
in
Theory of Computation
Jan 26, 2019
by
Shankar Kakde
338
views
answer
comment
Follow
share this
share
2 Comments
by
Magma
commented
Jan 26, 2019
reply
Follow
share this
A ???
0
0
by
Kunal Kadian
commented
Jan 26, 2019
reply
Follow
share this
Yes should be A.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
option a is right
abhishekmehta4u
answered
Mar 26, 2019
edited
Mar 26, 2019
by
abhishekmehta4u
by
abhishekmehta4u
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
abhiyodayapandey
asked
in
Theory of Computation
Jan 21
225
views
Gate CSE Made Easy Test Series
Construct a minimal finite state automation that accepts the language over {0, 1} of all strings that contain neither the substring 00 nor the substring 11. What is the number of states in this machine? For this question when we draw the DFA there ... and NFA contains 3 states minimum. So according to question what shall be the answer for this question? 3 or 4? Why?
abhiyodayapandey
asked
in
Theory of Computation
Jan 21
by
abhiyodayapandey
225
views
theory-of-computation
made-easy-test-series
0
votes
0
votes
1
answer
2
Rohit Chakraborty
asked
in
Theory of Computation
Oct 5, 2023
448
views
Made easy test series
Please explain the why A and D are correct?
Rohit Chakraborty
asked
in
Theory of Computation
Oct 5, 2023
by
Rohit Chakraborty
448
views
theory-of-computation
regular-expression
number-of-dfa
made-easy-test-series
0
votes
0
votes
2
answers
3
jugnu1337
asked
in
Theory of Computation
Sep 3, 2023
351
views
MADE EASY test series
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
jugnu1337
asked
in
Theory of Computation
Sep 3, 2023
by
jugnu1337
351
views
made-easy-test-series
finite-automata
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
