Modify the BCD parity detector of Table 14-9 for the case
Chapter 14, Problem 14.47(choose chapter or problem)
Modify the BCD parity detector of Table 14-9 for the case where the least significant bit of the BCD digits is received first. Construct the incompletely specified Mealy model state table. (Hint: It can be constructed by specifying states to remember the first 3 bits of a BCD digit, but not all sequences of length three have to be distinguished. It requires at most 11 states.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer