What you will be able to do. By the end of this chapter you will be able to say what a state is, describe a piece of behaviour as a state diagram, and turn that diagram into Verilog by a method that works every time. You will know the two kinds of state machine, Moore and Mealy, and when each is used. And you will have designed several machines that watch a stream of bits: detectors for a sequence and for a pattern, and a machine that tells whether a number arriving one bit at a time is divisible by 3 or by 5.
What a state is
The word has been with you for two chapters: the state of a sequential circuit is what it remembers. This chapter is about choosing what to remember, which is the real skill in designing sequential circuits.
Start away from electronics. You are reading a book and someone interrupts you. To carry on later you do not need to remember every word you have read. You need one thing: the page number. That single fact sums up the whole past, as far as carrying on is concerned.