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 7.3 Question 8 (Page No. 200)
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
160
views
0
votes
0
votes
Is the language $L =$ {$a^nb^m : n = m$ or $n = m + 2$} deterministic?
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
by
Naveen Kumar 3
160
views
answer
comment
Follow
share this
share
2 Comments
by
shivanisrivarshini
commented
Jun 23, 2019
reply
Follow
share this
NO
0
0
by
Ashwani Kumar 2
commented
Jun 23, 2019
reply
Follow
share this
Non deterministic CFL
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
0
answers
1
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
301
views
Peter Linz Edition 4 Exercise 7.3 Question 18 (Page No. 200)
Give an example of a deterministic context-free language whose reverse is not deterministic.
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
by
Naveen Kumar 3
301
views
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
0
votes
0
votes
0
answers
2
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
177
views
Peter Linz Edition 4 Exercise 7.3 Question 17 (Page No. 200)
Show that under the conditions of Exercise 16, $L_1 ∩ L_2$ is a deterministic context-free language.
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
by
Naveen Kumar 3
177
views
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
0
votes
0
votes
1
answer
3
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
243
views
Peter Linz Edition 4 Exercise 7.3 Question 16 (Page No. 200)
Show that if $L_1$ is deterministic context-free and $L_2$ is regular, then the language $L_1 ∪ L_2$ is deterministic context-free.
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
by
Naveen Kumar 3
243
views
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
0
votes
0
votes
1
answer
4
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
172
views
Peter Linz Edition 4 Exercise 7.3 Question 15 (Page No. 200)
Show that every regular language is a deterministic context-free language.
Naveen Kumar 3
asked
in
Theory of Computation
Jun 23, 2019
by
Naveen Kumar 3
172
views
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
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
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
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.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
This guy was just exceptional. I remember hearing...
Inspirational! Found the right Blog at the right...
That was my second attempt. I already had notes,...
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
