Varieties of learning automata: an overview
نویسندگان
چکیده
منابع مشابه
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper by Narendra and Thathachar (1974). Since then, there have been many fundamental advances in the theory as well as applications of these learning models. In the past few years, the structure of LA, has been modified in several directions to suit different applications. Concept...
متن کاملOn varieties of meet automata
Eilenberg’s variety theorem gives a bijective correspondence between varieties of languages and varieties of finite semigroups. The second author gave a similar relation between conjunctive varieties of languages and varieties of semiring homomorphisms. In this paper, we add a third component to this result by considering varieties of meet automata. We consider three significant classes of lang...
متن کاملOn Varieties of Ordered Automata
The classical Eilenberg correspondence, based on the concept of the syntactic monoid, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence appeared, with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. For example, classes of languages need not be clos...
متن کاملRepresenting Arithmetic Constraints with Automata: An Overview
Linear numerical constraints and their first-order theory, whether defined over the reals or the integers, are basic tools that appear in many areas of Computer Science. This paper overviews a set of techniques based on finite automata that lead to decision procedures and other useful algorithms, as well as to a normal form, for the first-order linear theory of the integers, of the reals, and o...
متن کاملCellular Automata Hardware Implementations - an Overview
Cellular automata model grew very popular decades ago with software applications like the Game of Life. From the computing theory’s perspective, it is a fundamental model of massive parallelism and was believed to offer extremely efficient solutions for hardware implementations. This paper overviews scientific literature and presents existing implementations of cellular automata, either in gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
سال: 2002
ISSN: 1083-4419
DOI: 10.1109/tsmcb.2002.1049606