|
Uchenyye zapiski UlGU. Seriya "Matematika i informatsionnyye tekhnologii", 2018, Issue 2, Pages 24–27
(Mi ulsu92)
|
|
|
|
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.
Received: 01.11.2018 Revised: 18.12.2018
Citation:
G. A. Zharkova, K. N. Laptev, “Deterministic and non-deterministic state automata in modern programming”, Uchenyye zapiski UlGU. Seriya “Matematika i informatsionnyye tekhnologii”, 2018, no. 2, 24–27
Linking options:
https://www.mathnet.ru/eng/ulsu92 https://www.mathnet.ru/eng/ulsu/y2018/i2/p24
|
Statistics & downloads: |
Abstract page: | 27 | Full-text PDF : | 18 | References: | 8 |
|