A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

As a generalization of a fuzzy finite state machine, the notion of a bipolar fuzzy finite state machine is introduced. Also, the concepts of a bipolar (immediate) successor, a bipolar exchange property and a bipolar subsystem are introduced. Some related properties are discussed. A condition for a bipolar fuzzy finite state machine to satisfy the bipolar exchange property is established. A char...

The recognition and learning of temporal sequences is fundamental to cognitive processing. Several recurrent networks attempt to encode past history through feedback connections from \context units". However, the internal representations formed by these networks is not well understood. In this paper, we use cluster analysis to interpret the hidden unit encodings formed when a network with conte...

In this paper we introduced homomorphism, strong homomorphism in bipolar fuzzy finite state machines and discuss their properties using bipolar-valued fuzzy set. Mathematics Subject Classification: 18B20, 68Q45, 68Q70, 03E72

The process of human segmentation and labelling of speech can be seen as a two-step process. In the first step humans listen to a speech signal, recognize the word and phoneme sequence, and roughly determine the position of each phonetic boundary. In the second step humans examine several speech signal features (waveform, energy, spectrogram, etc.) to place a phonetic boundary time mark where t...

A fuzzy method for incorporating the contextual constraints into a text recognition system is presented here. The method takes as input all the internal result that an Isolated Character Classifier (ICC) computes for an input letter, instead of an unique output character. The internal result is handled here as a fuzzy set which is then processed by a Deformed System. Such a Deformed System repr...

Here we study the notions of lattice-valued finite state machine and lattice-valued fuzzy transformation semigroup when the lattice consists of all the closed subintervals contained in [0, 1]. So, we can apply techniques of interval-valued fuzzy sets to fuzzy automata. In particular, we prove that Atanassov’s Kα operators allow us to retrieve the information given by the transition functions of...