Bounce filter. A finite'state transducer is a DFA whose output is a string of symbols. It is the same as a DFA except that each transition is labeled with an output symbol, which is to be output whenever the transition is made. Develop a transducer that removes isolated symbols from its input. Specifically, any occurrence of aaba in the input should be replaced by aaaa and any occurrence of bbab in the input should be replaced by bbbb in the output, but the input and output should otherwise be unchanged.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.