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 2.3 Question 8 (Page No. 62)
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
1,692
views
1
vote
1
vote
Find an nfa without $λ$-transitions and with a single final state that accepts the set {$a$} $∪$ {$b^n : n ≥1$}.
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
1.7k
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
5
votes
5
votes
Best answer
we can make a nfa with single final state
abhishekmehta4u
answered
Mar 30, 2019
selected
Mar 31, 2019
by
srestha
by
abhishekmehta4u
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
0
votes
0
votes
0
answers
1
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
362
views
Peter Linz Edition 4 Exercise 2.3 Question 14 (Page No. 62)
Let $L$ be any language. Define $even (w)$ as the string obtained by extracting from $w$ the letters in even-numbered positions; that is, if $w = a_1a_2a_3a_4…$, then $even (w)= a_2a_4.…$ Corresponding to this, we can define a language $even (L) =$ {$even (w): w ∈ L$}. Prove that if $L$ is regular, so is $even(L)$.
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
362
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
2
votes
2
votes
0
answers
2
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
461
views
Peter Linz Edition 4 Exercise 2.3 Question 13 (Page No. 62)
Give a simple verbal description of the language accepted by the dfa in following figure. Use this to find another dfa, equivalent to the given one, but with fewer states.
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
461
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
0
votes
0
votes
0
answers
3
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
195
views
Peter Linz Edition 4 Exercise 2.3 Question 12 (Page No. 62)
Show that if $L$ is regular, so is $L^R$.
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
195
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
regular-language
0
votes
0
votes
0
answers
4
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
210
views
Peter Linz Edition 4 Exercise 2.3 Question 11 (Page No. 62)
Prove that all finite languages are regular.
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
210
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
regular-language
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
