CSC 405 - Sequential Circuit Design Practice
Develop state transition diagram representations for each of the following sequential
circuits, or state why such a circuit is not possible.
1. A bit string recognizer for the bit pattern 0111.
2. A bit string recognizer for the bit pattern 0101 without overlap.
3. A bit string recognizer for the bit pattern 01.
4. A bit string recognizer for the bit pattern 1101 with overlap.
5. A bit string recognizer for the bit pattern 1101 without overlap.
6. A ring counter with output 0010.
7. A ring counter with output 000011.
8. A ring counter with output 010011000111.
9. A circuit that accepts binary encoded values that are divisible by 2.
10. A circuit that accepts binary encoded values that are divisible by 4.
11.A circuit that accepts binary encoded values that are divisible by 3.
12. A circuit that accepts strings with an even number of 1's.
13. A circuit that accepts strings with an even number of 1's and an even number of 0's.
14. A circuit that accepts strings with an even number of 1's or and even number of 0's.
15. A circuit that accepts strings with an even number of 1's and an odd number of 0's.
16. A circuit that accepts strings that have at least three 1's in a row.
17. A circuit that accepts strings that have no more than three 1's in a row.
18. A circuit that accepts strings with more 1's than 0's.
19. A circuit that accepts strings with the same number of 1's and 0's.
20. A serial 2-bit comparator that reads 2, 2-bit binary encoded values and outputs true
if the second 2-bit number is greater than the first.
21. A circuit that outputs a random sequence of 1's and 0's.
22. A circuit that outputs the sequence 01001000100001...
23. A recognizer for strings with a repeated (non-overlapping) 4-bit sequence.
24. A recognizer for strings that have no repeated 4-bit sequences.
25. A recognizer for binary strings that are palindromes.