When a robot interacts with the environment producing changes through its own actions, it should find opportunities for learning and updating its own models of the environment. A robot that is able to construct discrete models of the underlying dynamical system which emerges from this interaction can guide its own behavior and adapt it based on feedback from the environment. Thus, the induction...

In this paper, we dene the concepts of compatibility between twofuzzy subsets on Q, the set of states of a max- min general fuzzy automatonand transitivity in a max-min general fuzzy automaton. We then construct auniform structure on Q, and dene a topology on it. We also dene the conceptof semi-uniform structures on a nonempty set X and construct a semi-uniformstructure on the set of states of ...

Probabilistic finite automata (PFA) are recognizers of regular distributions over strings, a model that is widely applied in speech recognition and biological systems, for example. While the underlying structure PFA just normal automaton, it well known with non-deterministic more powerful than deterministic one. In this paper, we concentrate on passive learning from examples counterexamples usi...

The paper considers the generalized structure of maintenance system, including, in general case, protection subsystem, functional diagnostics test and repair subsystem. technical implementation listed subsystems is possible form tools built into object external to object. For transport technological machines ratios volumetric characteristics built-in are analyzed (using simplest analytical expr...

Polling policies have been introduced to simplify the accessing process in client/server systems by a centralized control access scheme. This paper considers a client/server model which employs a polling policy as its access strategy. We propose a learning-automata-based approach for polling in order to improve the throughput-delay performance of the system. Each client has an associated queue ...

Alberto Apostolico y Probabilistic models of various classes of sources are developed in the context of coding and compression as well as in machine learning and classi cation. In the rst domain, the repetitive structures of substrings are regarded as redundancies and sought to be removed. In the second, repeated subpatterns are unveiled as carriers of information and structure. In both context...