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
Michael Sipser Edition 3 Exercise 1 Question 17 (Page No. 86)
admin
asked
in
Theory of Computation
Apr 21, 2019
3,426
views
0
votes
0
votes
Give an $NFA$ recognizing the language $(01 ∪ 001 ∪ 010)^{*}.$
Convert this $NFA$ to an equivalent $DFA.$ Give only the portion of the $DFA$ that is reachable from the start state.
michael-sipser
theory-of-computation
finite-automata
admin
asked
in
Theory of Computation
Apr 21, 2019
by
admin
3.4k
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.
1
Answer
0
votes
0
votes
a) NFA
aditi19
answered
May 17, 2019
edited
May 17, 2019
by
aditi19
by
aditi19
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
2
votes
2
votes
1
answer
1
admin
asked
in
Theory of Computation
Apr 21, 2019
7,953
views
Michael Sipser Edition 3 Exercise 1 Question 21 (Page No. 86)
Use the procedure described in $\text{Lemma 1.60}$ to convert the following finite automata to regular expressions.
admin
asked
in
Theory of Computation
Apr 21, 2019
by
admin
8.0k
views
michael-sipser
theory-of-computation
finite-automata
regular-expression
0
votes
0
votes
1
answer
2
admin
asked
in
Theory of Computation
Apr 21, 2019
6,182
views
Michael Sipser Edition 3 Exercise 1 Question 19 (Page No. 86)
Use the procedure described in $\text{Lemma 1.55}$ to convert the following regular expressions to non-deterministic finite automata. $(0\cup 1)^{*}000(0\cup 1)^{*}$ $(((00)^{*}(11))\cup 01)^{*}$ $\phi^{*}$
admin
asked
in
Theory of Computation
Apr 21, 2019
by
admin
6.2k
views
michael-sipser
theory-of-computation
regular-expression
finite-automata
1
vote
1
vote
1
answer
3
admin
asked
in
Theory of Computation
Apr 21, 2019
4,439
views
Michael Sipser Edition 3 Exercise 1 Question 16 (Page No. 86)
Use the construction given in $\text{Theorem 1.39}$ to convert the following two non-deterministic finite automata to equivalent deterministic finite automata.
admin
asked
in
Theory of Computation
Apr 21, 2019
by
admin
4.4k
views
michael-sipser
theory-of-computation
finite-automata
0
votes
0
votes
0
answers
4
admin
asked
in
Theory of Computation
Oct 17, 2019
253
views
Michael Sipser Edition 3 Exercise 4 Question 17 (Page No. 212)
Prove that $EQ_{DFA}$ is decidable by testing the two DFAs on all strings up to a certain size. Calculate a size that works.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
253
views
michael-sipser
theory-of-computation
finite-automata
decidability
proof
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
