Bulakh E. State machine with pseudo-casual transitions and methods of information security on their basis

The aim of the work is developing the fundamentals of algo-rithmic and structural synthesis of state machines with pseudo-casual transitions and creating substitutional methods of information security on their basis. The methods of inves-tigation include the theory of graphs and mathematical pro-gramming. The relations for decision function and strategy of searching search algorithms of a point of a unimodal function extremum are obtained. The said algorithms are interference resistant to virtual sequences of serch algoritms and describe the functioning of such automata which are generators of substitutions of input alphabet symbols. Structural schemes of the automata are obtained. Methods of constructing abun-dant representations of decimal numbers on whose basis new methods of information security from unauthorized access and failures in an information transmission channel are syn-thesized are developed. The automata suggested can be used in analogue and digital converters, in interference resistant search, in code theory in searching for a unimodal function extremum point