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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
