Register

Peter Linz ex 2.2

2,514 views

1 Answer

0 0 votes

Assuming  Σ1 = { 0, 1, 2, . . . , 9 } , NFA for L is 

Voting & Accepting an answer helps improve the community
← Previous · Recurence relationNext → · Self doubt
← Previous in category · Peter Linz ex-2.3Next in category → · Self doubt
Position:
Show:

Related questions

2 2 votes
2 answers 2 answers
2.8k
2.8k views
Soumya29 asked Sep 18, 2018
2,797 views
Peter Linz 4th edition Ex-1.2 -Q10
Q- Prove or Disprove the following claim- $(L^R)^*=(L^*)^R$for all languages.
1 1 vote
0 0 answers
475
475 views
Surya Dhanraj asked Aug 2, 2017
475 views
Peter Linz ex 2.1
Convert into dfa on {a,b}L = w: |w|mod3=0, |w|!=5L= w:Na(w)mod3<Nb(w)mod3L= w: (Na(w)+2Nb(w))mod3<1
2 2 votes
1 1 answer
5.0k
5.0k views
Surya Dhanraj asked Jul 31, 2017
5,045 views
Peter Linz ex-2.3
Convert the nfa defined byδ (q0,a)={q0,q1}δ (q1,b)={q1,q2}δ (q2,a)={q2}δ (q1,λ)={q1,q2}Where q0 is initial state and q2 final state into equivalent DFA.
1 1 vote
0 0 answers
1.7k
1.7k views
Sanjay Sharma asked Sep 18, 2018
1,726 views
pumping lemma peter linz EX
Let L={a^nb^m: n>=100 , m<=50}Can you use the pumping lemma to show that L is not regular? Explain your answers