Question
Create a finite state machine that recognizes the input strings a, ab and bb by outputting a 1 (otherwise output 0 for the input). The
Create a finite state machine that recognizes the input strings a, ab and bb by outputting a 1 (otherwise output 0 for the input).
The input alphabet is {a, b}. 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.
-
c) What is the sequence of states your FSM will go through when the string
aaabbabaa is input?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Logics For Databases And Information Systems
Authors: Jan Chomicki ,Gunter Saake
1st Edition
1461375827, 978-1461375821
