Devise a DFSA that accepts the language of strings over f0; 1g with an odd number of 1s and and even number of 0s. ('*' = '>')
Empty String --> A
A + 0 ---> C
A + 1 ---> E
E + 1 ---> D
D + 1 ---> E
C + 0 ---> D
D + 0 ---> C
E + 0 ---> B
B + 0 ---> E
C + 1 ---->B
B + 1 ---> C
(sorry i couldn't draw a picture.. I tried to make one text based and it turned out disgusting)
A -> empty string only
B-> odd # of 1's, odd # of 0
C-> even # of 1's, odd # of 0
D-> even # of 1's, even # of 0
E-> odd # of 1's, even # of 0
No comments:
Post a Comment