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 3.3 Question 2 (Page No. 96)
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
200
views
0
votes
0
votes
Find a regular grammar that generates the language $L (aa^* (ab+ a)^*)$ .
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
by
Naveen Kumar 3
200
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.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
479
views
Peter Linz Edition 4 Exercise 3.3 Question 5 (Page No. 96)
Find a left-linear grammar for the language accepted by the nfa below.
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
by
Naveen Kumar 3
479
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
0
votes
0
votes
0
answers
2
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
203
views
Peter Linz Edition 4 Exercise 3.3 Question 4 (Page No. 96)
Construct right- and left-linear grammars for the language $L =$ {$a^nb^m : n ≥ 2, m ≥ 3$}.
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
by
Naveen Kumar 3
203
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
0
votes
0
votes
0
answers
3
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
194
views
Peter Linz Edition 4 Exercise 3.3 Question 3 (Page No. 96)
Construct a left-linear grammar for the language generated by the grammar $S → abA,$ $A → baB,$ $B → aA|bb.$
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
by
Naveen Kumar 3
194
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
0
votes
0
votes
0
answers
4
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
221
views
Peter Linz Edition 4 Exercise 3.3 Question 1 (Page No. 96)
Construct a dfa that accepts the language generated by the grammar $S → abA, A → baB, B → aA|bb$ .
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
by
Naveen Kumar 3
221
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
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
