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...

IJSER © 2015 http://www.ijser.org A Novel Method To Construct Deterministic Finite Automata From AGiven Regular Grammar K.Senthil Kumar D.Malathi Abstract—Membership checking is an important task in language formalism. In regular Language ,Deterministic Finite Automata plays membership checking in a convenient way. Regular language is normally represented by regular expression from which peopl...

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published ”folk theor...

In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type  and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a  Lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. Also by  provingsome theorems, ...

in this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. in fact, we obtain somelowen-type  and chang-type fuzzy topologies on general fuzzyautomata. to this end, first we define a kuratowski fuzzy interioroperator which induces a  lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. also by  provingsome theorems, ...

Applying the methods of Artificial Intelligence to clinical monitoring requires some kind of signal-to-symbol conversion as a prior step. Subsequent processing of the derived symbolic information must also be sensitive to history and development, as the failure to address temporal relationships between findings invariably leads to inferior results. DIAMON-1, a framework for the design of diagno...

This paper presents a modelling strategy that combines Neuro-Fuzzy methods to define the material model with Cellular Automata representations of the microstructure, all embedded within a Finite Element solver that can deal with the large deformations of metal processing technology. We use the acronym nf-CAFE as a label for the method. The need for such an approach arises from the twin demands ...

In this note first by considering the notion of general fuzzy automata (for simplicity GFA), we define the notions of direct product, restricted direct product and join of two GFA. Also, we introduce some operations on (Fuzzy) sets and then prove some related theorems. Finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given GFA....

Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [MC 97], and by A. Kondacs and J. Watrous [KW 97]. This notion is not a generalization of the deterministic finite automata. Moreover, in [KW 97] it was proved that not all regular languages can be recognized by quantum finite automata. A. Ambainis and R. Freivalds [AF 98] proved that for some languages quantum finite automa...