Register

Peter Linz Edition 4 Exercise 2.2 Question 16 (Page No. 55)

• edited by
890 views
0 votes
0 votes
Find an nfa that accepts {$a$}* and is such that if in its transition graph a single edge is removed
(without any other changes), the resulting automaton accepts {$a$}.

Can this be solved using a dfa? If so, give the solution; if not, give convincing arguments
for your conclusion. (Question 17)
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Mar 22, 2019
422 views
Peter Linz Edition 4 Exercise 2.2 Question 14 (Page No. 55)
Let $L$ be the language accepted by the nfa in the following figure: Find an nfa that accepts $L$ $∪$ {$a^5$} .
Let $L$ be the language accepted by the nfa in the following figure:Find an nfa that accepts $L$ $∪$ {$a^5$} .
User Avatar
0 votes
0 votes
1 answer
3
Naveen Kumar 3 asked Mar 22, 2019
307 views
Peter Linz Edition 4 Exercise 2.2 Question 13 (Page No. 55)
What is the complement of the language accepted by the nfa in the following figure:
What is the complement of the language accepted by the nfa in the following figure:
User Avatar
2 votes
2 votes
1 answer
4
Naveen Kumar 3 asked Mar 22, 2019
3,310 views
Peter Linz Edition 4 Exercise 2.2 Question 11 (Page No. 55)
Find an nfa with four states for $L$ = {$a^n: n ≥ 0$} $∪$ {$b^na: n ≥ 1$} .
Find an nfa with four states for $L$ = {$a^n: n ≥ 0$} $∪$ {$b^na: n ≥ 1$} .
User Avatar
Link Copied!