In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...

Learning automata are used at the source nodes of a multimedia network to dynamically control the externally arriving traffic to the network. A new fixed structure learning automaton algorithm is used to control the traffic. At every network source, each different traffic type (data, voice, video, e.t.c.) is controlled by a different learning automaton. Every learning automaton makes its decisi...

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic models through inductive generalisation. The inductive generalisation algorithms consist of three parts. The first part describes the graphical generalisation of state transition models. State transition models are generalised by a...

Given an oracle which can answer membership and equivalence queries for an unknown regular language, we present algorithms for learning the regular set perfectly. For the case where the oracle cannot reset the black box automaton to a fixed initial state, we present efficient learning algorithms using homing sequences. Algorithms have been described for two different representations of the fini...

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

We present a new fixed structure, multi-action, multi-response learning automaton and use it to allocate arriving traffic at a multimedia network. For each source-destination pair, for each traffic type, a learning automaton allocates every new arriving call on one of the available routes from source to destination or rejects it. The state diagram of the learning automaton has a star shape. Eac...