Analysis of Average Time of Searching Noise-like Signals for Systems with One Absorbing State

Modified presentations of search systems in a form of directed graphs with one absorbing state and penalty for false alarms are considered. Based on the Markovian chain apparatus, as well as on theory of directed graphs and generating functions, transfer functions of search systems are deduced for their modified representation, and also the efficiency of the chosen systems for search noise-like signals is analyzed in detail. It is shown that the presented search systems as a directed graph with one absorbing state allows one to obtain approximating estimations of the optimal time for analysis of one cell of the signal uncertainty area using criterion of the minimal average time of search until the signal is successfully detected.