1. For ∑ ={ a,b }, construct dfa's that accept the sets consisting of
a) all strings with exactly one a.
b) all strings with at least one a.
c) all strings with no more than 3 a's.
d) all strings with at least one a and exactly two b's.
e) all strings with exactly two a's and more than two b's.
Solutions:
a) all strings with exactly one a.
Solution:
b) all strings with at least one a.
Solution:
c) all strings with no more than 3 a's
Solution:
d) all strings with at least one a and exactly two b's.
Solution:
e) all strings with exactly two a's and more than two b's.
Solution:
1 Comments
This comment has been removed by the author.
ReplyDelete