Register

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

• edited by
548 views
1 votes
1 votes

Also is this nfa possible with less than three states??

• 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
3
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
4
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
Link Copied!