The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Michael Sipser Edition 3 Exercise 4 Question 2 (Page No. 211)
0
votes
12
views
Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable.
michael-sipser
theory-of-computation
finite-automata
regular-expressions
decidability
proof
asked
Oct 16
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.9k
points)
|
12
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
Michael Sipser Edition 3 Exercise 4 Question 3 (Page No. 211)
Let $ALL_{DFA} = \{ \langle{ A }\rangle \mid A \text{ is a DFA and}\: L(A) = \Sigma^{\ast}\}.$ Show that $ALL_{DFA}$ is decidable.
asked
Oct 16
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.9k
points)
|
6
views
michael-sipser
theory-of-computation
turing-machine
finite-automata
decidability
proof
0
votes
0
answers
2
Michael Sipser Edition 3 Exercise 4 Question 14 (Page No. 211)
Let $\Sigma = \{0,1\}$. Show that the problem of determining whether a $CFG$ generates some string in $1^{\ast}$ is decidable. In other words, show that $\{\langle {G \rangle}\mid \text{G is a CFG over {0,1} and } 1^{\ast} \cap L(G) \neq \phi \}$ is a decidable language.
asked
Oct 17
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.9k
points)
|
3
views
michael-sipser
theory-of-computation
cfg
decidability
proof
0
votes
0
answers
3
Michael Sipser Edition 3 Exercise 4 Question 13 (Page No. 211)
Let $A = \{ \langle{ R, S \rangle} \mid \text{R and S are regular expressions and} \: L(R) \subseteq L(S)\}$. Show that $A$ is decidable.
asked
Oct 17
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.9k
points)
|
2
views
michael-sipser
theory-of-computation
decidability
proof
0
votes
0
answers
4
Michael Sipser Edition 3 Exercise 4 Question 12 (Page No. 211)
Let $A = \{\langle{ M \rangle} \mid \text{M is a DFA that doesn’t accept any string containing an odd number of 1s}\}$.Show that $A$ is decidable.
asked
Oct 17
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.9k
points)
|
6
views
michael-sipser
theory-of-computation
decidability
proof
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.3k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.5k
Others
1.5k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
Really helpful sir Thanks a ton👍👍
Amazing work Sir
Not in my hands. Flipkart is showing my location...
Arjun sir, plz provide go book through...
@
[email protected]
Can this be updated?
50,644
questions
56,523
answers
195,602
comments
101,282
users