On one construction of a finite automation

  • Authors:

  • Tariel Khvedelidze;Irma Aslanishvili

  • Affiliations:

  • Department of Computer Scienses, Tbilisi State University, Tbilisi, Georgia;Department of Computer Scienses, Tbilisi State University, Tbilisi, Georgia

  • Venue:
  • ECC'09 Proceedings of the 3rd international conference on European computing conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

An algorithm of the behavior of a finite automation in a stationary random medium with binary reactions is proposed. The problem of expedient behavior of the considered automation is studied by the methods of the random walk theory and the conditions are obtained under which its behavior in a stationary random medium is expedient.