Register

Peter Linz Edition 4 Exercise 2.3 Question 1 (Page No. 62)

440 views
1 votes
1 votes

Theorem: Let $L$ be the language accepted by a nondeterministic finite accepter $M_N= (Q_N, Σ,δ N,q0,F_N)$. Then
there exists a deterministic finite accepter $M_D= (Q_D, Σ,δ_D,${$q_0$}$,F_D)$ such that
$L= L (M_D)$.

convert the nfa in following figure to a dfa:

Can you see a simpler answer more directly?

User Avatar

1 Answer

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

Related questions

390
views
0 answers
0 votes
Naveen Kumar 3 asked Mar 30, 2019
390 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 ineven-numbered positions; that is, if $w = a_1a_2a_3a_4 $,then ... $L$ is regular, so is $even(L)$.
User Avatar
530
views
0 answers
2 votes
Naveen Kumar 3 asked Mar 30, 2019
530 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.
User Avatar
203
views
0 answers
0 votes
Naveen Kumar 3 asked Mar 30, 2019
203 views
Peter Linz Edition 4 Exercise 2.3 Question 12 (Page No. 62)
Show that if $L$ is regular, so is $L^R$.
User Avatar
221
views
0 answers
0 votes
Naveen Kumar 3 asked Mar 30, 2019
221 views
Peter Linz Edition 4 Exercise 2.3 Question 11 (Page No. 62)
Prove that all finite languages are regular.
User Avatar
Link Copied!