Abstract

The output function recognition of a binary automaton with random Bernoulli input by the character frequency in the output sequence is considered. On the set of output functions, an equivalence relation is introduced, the classes of which consist of functions that are indistinguishable in the scheme. The problem of recognizing the equivalence class of the output function is reduced to the integer optimization problem. Three partial classes of automata close to shift registers are considered.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.