Page 1 of 1
Create a finite state machine that recognizes the input strings "abe" and "ccb" by outputting a 1 (otherwise output 0).
Posted: Tue Jul 12, 2022 8:10 am
by answerhappygod
- Create A Finite State Machine That Recognizes The Input Strings Abe And Ccb By Outputting A 1 Otherwise Output 0 1 (41.17 KiB) Viewed 56 times
Create a finite state machine that recognizes the input strings "abe" and "ccb" by outputting a 1 (otherwise output 0). The input alphabet is (a, b, c). The output alphabet is {0, 1). The input stream may be any length, beginning with any arbitrary sequence of the input alphabet. The FSM should be completely specified. The FSM must include both inputs and outputs for each transition. The state transition tables should specify both outputs and next states. The FSM should not terminate. The FSM should recognize overlapping tokens (input strings). a) Draw the FSM. b) Create the state transition table. Grading Rubric Parts a and b are worth a maximum of 50 points each. Your FSM in part a need not be minimal. It must correctly recognize all specified tokens (-25 points if it fails to recognize a valid token). It must not recognize any incorrect tokens (-25 points if it does). The state transition table in part b should match the diagram - errors from the design of the diagram do not count against the table, just consistency with the diagram. -5 points for each inconsistency.