Question: 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
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
Step by Step Solution
3.35 Rating (158 Votes )
There are 3 Steps involved in it
To draw and analyze Finite State Machines FSM for the given cases we need to understand the working principles of FSMs and use them to design systems ... View full answer
Get step-by-step solutions from verified subject matter experts
