Register

Peter linz, chapter 7 exercises

716 views
1 votes
1 votes

Is the language L={anbm :n=m or n=m+2} deterministic? 

User Avatar

1 Answer

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

Related questions

5 votes
5 votes
3 answers
1
Sangam asked Aug 1, 2016
3,733 views
Theory Of Computation, Chapter 2, Exercises 2 (e) Minimal DFA
Construct a minimal DFA for the given language. How to find the union of two DFA's ?
Construct a minimal DFA for the given language.How to find the union of two DFA's ?
User Avatar
0 votes
0 votes
0 answers
2
Waseemkhan23 asked Jan 13, 2019
752 views
Peter Linz Chapter 7.1 Q4.j
Is language CFL? L={w: 2n(a) <= n(b) <= 3 n(c)}
Is language CFL? L={w: 2n(a) <= n(b) <= 3 n(c)}
User Avatar
0 votes
0 votes
0 answers
3
Ashish RajAnand asked Nov 22, 2018
353 views
formal language and automata by peter linz chapter 1.2 exercise 7
User Avatar
0 votes
0 votes
0 answers
4
shouryarshi asked Aug 22, 2018
605 views
Peter Linz 6th edition,Chapter-3.1,Q22
Determine whether or not the following claims are true for all regular expressions r1 and r2. a) (r1*)* equivalent to r1* b) r1*(r1+r2)* equivalent to (r1+r2)* c) (r1+r2)* equivalent to (r1*r2*)* d) (r1r2)* equivalent to r1*r2*
Determine whether or not the following claims are true for all regular expressions r1 and r2.a) (r1*)* equivalent to r1*b) r1*(r1+r2)* equivalent to (r1+r2)*c) (r1+r2)* e...
User Avatar
Link Copied!