On recognition of the shift register output function with a random input for a Markov model of an input sequence

The problem of recognizing the output function of a binary non-autonomous shift register is considered, the input of which receives a sequence of random variables connected in a simple homogeneous stationary Markov chain. The statistics of symbol frequencies in the output register sequence is used. The recognition problem is reduced to the form of integer minimization of the linear form module under linear constraints. The results are compared with the case when the input sequence is Bernoulli. © 2020 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). CEUR Workshop Proceedings (CEUR-WS.org)