CS 404 Artificial Intelligence

2. (10 pts) Finite State Machine a) Draw a Finite State Machine as a graph accepting binary numbers that start with the pattern 101. Test your FSM for below cases. Accepts: 1010010; Rejects: 11001, 010101, 100101 b) Draw a Finite State Machine accepting strings as a graph that contain the pattern AABB anywhere. Strings consist of only {A, B, C). Test your FSM for below cases. Accepts: CAAABBCBA; Rejects: CAABA, ABAAC, AAAC