Fuzzy automaton finite state recognition

The fuzzy automaton finite state recognition problem is investigated. We introduced a generalized definition of a homing sequence for fuzzy automaton (FA). The investigated problem for FA belongs to the class of multicriteria problems, which distinguishes it from the analogous problem for classical...

Full description

Saved in:
Bibliographic Details
Published in:Automatic control and computer sciences 2012-09, Vol.46 (5), p.185-190
Main Author: Speransky, D. V.
Format: Article
Language:English
Subjects:
Computer Science
Control Structures and Microprogramming
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The fuzzy automaton finite state recognition problem is investigated. We introduced a generalized definition of a homing sequence for fuzzy automaton (FA). The investigated problem for FA belongs to the class of multicriteria problems, which distinguishes it from the analogous problem for classical finite state automatons. Algorithms for constructing generalized homing sequences that are optimal according to various criteria are proposed.
ISSN:0146-4116
1558-108X
DOI:10.3103/S0146411612050070