Use JFLAP to complete this assignment.

Create FA for each of the following problems. Once you complete the FA, test it. Copy the tests into a txt file. Load the txt file through Input->Multiple Run, or just use Ctrl+M. Then Load Inputs and select the txt file. Then Run Inputs. When your FA accepts and rejects all words appropriately save your machine. Once you have all your machines built, zip and submit the save files.

Assume common sense applies (which includes knowing the test words is an incomplete list). JFLAP allows the FAs to be non-deterministic (two edges with the same value can go into two different nodes). Be careful and ensure your FA is deterministic (you can test through Convert->Convert to DFA, and it should prompt This is not an NFA!)

1 - Chp 4 #8. All words in which a is tripled and b is tripled, but not both. This means each word contains the substring aaa or the substring bbb but not both

These_strings_should_accept

aaa

bbb

baaab

abbba

abbb

bbba

baaa

aaab

abaaaab

aaaaaaa

bbbbbbb

bbaaabb

These_strings_should_reject

bbbaaa

aaabbb

abba

a

b

ab

ba

abab

aabb

aaababababbb

bbbabababaaa

2 - Chp 4 #5 (i). All strings that end in a double letter:

These_strings_should_accept

aa

bb

aaa

aaaa

aaaaa

bbb

bbbb

bbbbb

abaa

baaa

babb

abababababababababababababababaa

abababababababababababababababb

These_strings_should_reject

a

b

ab

ba

abba

abababababababababababababababa

bbab

bbbbbbbbbbbbbbbbbbbba

3 - Chp 4 #10. All strings in which the total number of as is divisible by 3 no matter how they are distributed.

These_strings_should_accept

b

aaa

aaaaaa

aaaaaaaaa

aaabbb

abaa

aaabaaa

aaaaaabbaaa

babbbabbbabaaba

abbaa

bbaaabbbaaabbb

These_strings_should_reject

a

ab

ba

abba

aaaaa

abaabbba

abaabbbaba

abababababababababababababab

bbab

bbbbbbbbbbbbbbbbbbbba

4 - Chp 4 #11. (iii) ODD-ODD, all strings that have an odd number of as and an odd number of bs

These_strings_should_accept

ab

aaab

aaaaab

aaaaaaab

baaa

baaaaa

ba

bbba

bbbbba

bbbbbbba

abaa

ababab

aaaaabbb

These_strings_should_reject

a

aa

aaa

b

bbb

bb

abba

aabb

aaabb

ababa

babbbba

5 - Chp 4 #11. (ii) All strings that have an even number of as and an odd number of bs

These_strings_should_accept

b

bbb

bbbbb

aab

aaaba

aaabaaa

baaaaaaaa

abaaa

abaaaaa

aba

bbbaa

bbbbbaa

bbbbbbbaa

aabaa

abababa

abaabaaba

These_strings_should_reject

a

aa

aaa

ab

bb

bbbb

abba

aabb

aaabb

ababa

abaabaabaaba

6 - EVEN-EVEN-EVEN, all words in which each letter appears an even number of times. Assume an alphabet of {a b c}

These_strings_should_accept

aa

bb

cc

bbbb

aabb

aacc

bbcc

ccbbaa

abcabc

cbacba

accbab

accbabaa

bbaaccabccba

cccbbaabbccc

These_strings_should_reject

a

b

c

abc

bbb

aaabb

ababa

cccccbcccbcccb

abcbbbcb

ccccc

aaaaacccc

ab