The document describes three finite state machines (FSMs):
1. A 101 pattern detector that detects a repeating 101 bit pattern in the input and sets the output when detected.
2. A bit stream divider that detects if a bit stream is divisible by 7.
3. A bit stream divider that detects if a bit stream is divisible by 5 and sets a flag output when detected. It uses a 3-bit state register to track the remainder.
The document describes three finite state machines (FSMs):
1. A 101 pattern detector that detects a repeating 101 bit pattern in the input and sets the output when detected.
2. A bit stream divider that detects if a bit stream is divisible by 7.
3. A bit stream divider that detects if a bit stream is divisible by 5 and sets a flag output when detected. It uses a 3-bit state register to track the remainder.
The document describes three finite state machines (FSMs):
1. A 101 pattern detector that detects a repeating 101 bit pattern in the input and sets the output when detected.
2. A bit stream divider that detects if a bit stream is divisible by 7.
3. A bit stream divider that detects if a bit stream is divisible by 5 and sets a flag output when detected. It uses a 3-bit state register to track the remainder.