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
Peter Linz Edition 4 Exercise 1.2 Question 7 (Page No. 28)
Naveen Kumar 3
asked
in
Theory of Computation
Mar 18, 2019
165
views
1
vote
1
vote
Are there languages for which $(L^c)^*=(L^*)^c$
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
Naveen Kumar 3
asked
in
Theory of Computation
Mar 18, 2019
by
Naveen Kumar 3
165
views
answer
comment
Follow
share this
share
2 Comments
by
abhishekmehta4u
commented
Mar 18, 2019
reply
Follow
share this
There are no such lang exist
0
0
by
Deepak Poonia
commented
Aug 11, 2022
reply
Follow
share this
Detailed Video Solution
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
0
votes
0
votes
1
answer
1
swpril
asked
in
Theory of Computation
Jul 8, 2018
1,175
views
Peter Linz Edition 4 Exercise 2.1 Question 7 (Page No. 47)
Can you please help me. I don't understand the question statement, please explain this question's statements. What they are trying to say in each statement what does L={w:|w| mod 2=0} means? Explain any one of them, please. Chapter 2 Exercise Question 7(a,b,c,d.e,f Peter Linz
swpril
asked
in
Theory of Computation
Jul 8, 2018
by
swpril
1.2k
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
2
votes
2
votes
1
answer
2
Manish Kumar 24
asked
in
Theory of Computation
Feb 19, 2018
796
views
Peter Linz Edition 4 Exercise 2.1 Question 7.e (Page No. 47)
Please help in creating the DFA for (na (w)-nb (w))mod 3>0
Manish Kumar 24
asked
in
Theory of Computation
Feb 19, 2018
by
Manish Kumar 24
796
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
2
votes
2
votes
1
answer
3
Vijendra Singh
asked
in
Theory of Computation
Sep 28, 2016
329
views
Peter Linz Edition 4 Exercise 2.1 Question 7 (Page No. 47)
Plez Tell someone briefly ..............though i have already the anwers but i couldn't get it properlyyy
Vijendra Singh
asked
in
Theory of Computation
Sep 28, 2016
by
Vijendra Singh
329
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
0
votes
0
votes
0
answers
4
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
238
views
Peter Linz Edition 4 Exercise 2.4 Question 7 (Page No. 69)
Show that indistinguishability is an equivalence relation but that distinguishability is not.
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
238
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
