Estimating a Polyhedron Method Informativeness in the Problem of Checking the Automaton by the Statistical Properties of the Input and Output Sequences

The problem of verification of the Moore finite state machine by the statistical properties of the input and output sequences is considered. It is assumed that the initial state of the automaton is unknown. To verify the automaton, the polyhedra method is used. The results of computational experiments for four classes of non-autonomous binary shift registers are presented. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Authors
Melnikov S.Y. , Samouylov K.E. , Zyazin A.V.
Publisher
Springer Science and Business Media Deutschland GmbH
Language
English
Pages
42-51
Status
Published
Volume
1748 CCIS
Year
2023
Organizations
  • 1 Peoples’ Friendship University of Russia (RUDN University), Moscow, Russian Federation
  • 2 MIREA – Russian Technological University, Moscow, Russian Federation
Keywords
experiments with automata; finite automaton; identification of automata; PRNG; shift register
Share

Other records