Deterministic and non-deterministic state automata in modern programming

G. A. Zharkova, K. N. Laptev

Ulyanovsk State University

Abstract: The article describes deterministic, non-deterministic and probabilistic finite automata. The division of program execution into automaton steps and the transfer of information from step to step through the state is necessary when building event-oriented applications. The use of probabilistic automata affects such areas as the creation of artificial intelligence systems, working with fuzzy sets, fuzzy logic, recognition of complex images, etc.

Keywords: deterministic and non-deterministic automata, probabilistic automata, pattern recognition.

UDC: 519.713:004.42

Received: 01.11.2018
Revised: 18.12.2018

Bibliographic databases:

•