The Problem: Derive the state diagram for a circuit that takes one input, A and gives out one output X, X is to be one, if and only if it detects a sequence "101" in A.
Understanding The problem:
Now the first problem is how many states have I got?, for me its two, some of my colleagues argue that they are three. the second question is how many bits do I need for each state, shouldn't they be three? This isn't the whole problem, I should then use flip flops to implement it, but I'm stuck at the state diagram.