Question
Test your new string transmitter program from the previous exercise using a faulty communication channel that forgets the first bit, which can be modelled using the tail function on lists of bits.
Step 1
First, we need to define our faulty communication channel. In this case, the channel forgets the first bit of the transmitted message. We can model this behavior using the `tail` function on lists of bits. Show more…
Show all steps
Your feedback will help us improve your experience
Chris Trentman and 53 other educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Construct a finite-state machine that changes every other bit, starting with the second bit, of an input string, and leaves the other bits unchanged.
Modeling Computation
Finite-State Machines with Output
Suppose you received these bit strings over a communications link, where the last bit is a parity check bit. In which string are you sure there is an error? $$ \begin{array}{ll}{\text { a) } 00000111111} & {\text { b) } 10101010101} \\ {\text { c) } 11111100000} & {\text { d) } 10111101111}\end{array} $$
Number Theory and Cryptography
Applications of Congruences
Construct a finite-state automaton that recognizes the set of bit strings consisting of a 0 followed by a string with an odd number of 1 $\mathrm{s}$ .
Finite-State Machines with No Output
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD