Standard

Behavior of finite-nonstationary deterministic automata in a fuzzy environment. / Ponomareva, A. Yu.

в: Vestnik St. Petersburg University: Mathematics, Том 49, № 1, 01.01.2016, стр. 23-33.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Ponomareva, AY 2016, 'Behavior of finite-nonstationary deterministic automata in a fuzzy environment', Vestnik St. Petersburg University: Mathematics, Том. 49, № 1, стр. 23-33. https://doi.org/10.3103/S1063454116010106

APA

Ponomareva, A. Y. (2016). Behavior of finite-nonstationary deterministic automata in a fuzzy environment. Vestnik St. Petersburg University: Mathematics, 49(1), 23-33. https://doi.org/10.3103/S1063454116010106

Vancouver

Ponomareva AY. Behavior of finite-nonstationary deterministic automata in a fuzzy environment. Vestnik St. Petersburg University: Mathematics. 2016 Янв. 1;49(1):23-33. https://doi.org/10.3103/S1063454116010106

Author

Ponomareva, A. Yu. / Behavior of finite-nonstationary deterministic automata in a fuzzy environment. в: Vestnik St. Petersburg University: Mathematics. 2016 ; Том 49, № 1. стр. 23-33.

BibTeX

@article{82eead74661242d6aea7ff75239b20f5,
title = "Behavior of finite-nonstationary deterministic automata in a fuzzy environment",
abstract = "The paper presents a method of finding optimal control of generalized deterministic abstract automaton, the structure of which is given by an arbitrary finite graph in a fuzzy environment. The control is found in order to achieve a fuzzy goal, which is given as a fuzzy set in any fixed finite vertex of the automaton structural graph. The problem solution is divided into two stages. The first stage provides the greatest possible degree of achieving the fuzzy goal depending on the path from the initial graph vertex to the fixed one, while the second stage makes it possible to construct a set of input words that ensure the achievement of this goal on the selected path. The conclusion presents an example of the application of the proposed method for constructing a regular expression of control sequences for the given abstract finite-nonstationary deterministic automaton.",
keywords = "finite-nonstationary generalized abstract deterministic automaton, fuzzy given environment, fuzzy goal, optimal control",
author = "Ponomareva, {A. Yu}",
note = "Publisher Copyright: {\textcopyright} 2016, Allerton Press, Inc.",
year = "2016",
month = jan,
day = "1",
doi = "10.3103/S1063454116010106",
language = "English",
volume = "49",
pages = "23--33",
journal = "Vestnik St. Petersburg University: Mathematics",
issn = "1063-4541",
publisher = "Pleiades Publishing",
number = "1",

}

RIS

TY - JOUR

T1 - Behavior of finite-nonstationary deterministic automata in a fuzzy environment

AU - Ponomareva, A. Yu

N1 - Publisher Copyright: © 2016, Allerton Press, Inc.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - The paper presents a method of finding optimal control of generalized deterministic abstract automaton, the structure of which is given by an arbitrary finite graph in a fuzzy environment. The control is found in order to achieve a fuzzy goal, which is given as a fuzzy set in any fixed finite vertex of the automaton structural graph. The problem solution is divided into two stages. The first stage provides the greatest possible degree of achieving the fuzzy goal depending on the path from the initial graph vertex to the fixed one, while the second stage makes it possible to construct a set of input words that ensure the achievement of this goal on the selected path. The conclusion presents an example of the application of the proposed method for constructing a regular expression of control sequences for the given abstract finite-nonstationary deterministic automaton.

AB - The paper presents a method of finding optimal control of generalized deterministic abstract automaton, the structure of which is given by an arbitrary finite graph in a fuzzy environment. The control is found in order to achieve a fuzzy goal, which is given as a fuzzy set in any fixed finite vertex of the automaton structural graph. The problem solution is divided into two stages. The first stage provides the greatest possible degree of achieving the fuzzy goal depending on the path from the initial graph vertex to the fixed one, while the second stage makes it possible to construct a set of input words that ensure the achievement of this goal on the selected path. The conclusion presents an example of the application of the proposed method for constructing a regular expression of control sequences for the given abstract finite-nonstationary deterministic automaton.

KW - finite-nonstationary generalized abstract deterministic automaton

KW - fuzzy given environment

KW - fuzzy goal

KW - optimal control

UR - http://www.scopus.com/inward/record.url?scp=84979530477&partnerID=8YFLogxK

U2 - 10.3103/S1063454116010106

DO - 10.3103/S1063454116010106

M3 - Article

AN - SCOPUS:84979530477

VL - 49

SP - 23

EP - 33

JO - Vestnik St. Petersburg University: Mathematics

JF - Vestnik St. Petersburg University: Mathematics

SN - 1063-4541

IS - 1

ER -

ID: 86278071