Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...

Neurofuzzy systems—the combination of artificial neural networks with fuzzy logic—have become useful in many application domains. However, conventional neurofuzzy models usually need enhanced representational power for applications that require context and state (e.g., speech, time series prediction, control). Some of these applications can be readily modeled as finite state automata. Previousl...

Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...

This paper concerns computational methods for verifying properties of polyhedral invariant hybrid automata (PIHA), which are hybrid automata with discrete transitions governed by polyhedral guards. To verify properties of the state trajectories for PIHA, the planar switching surfaces are partitioned to define a finite set of discrete states in an approximate quotient transition system (AQTS). S...

The quotient operation, which is dual to the composition, is crucial in specification theories as it allows the synthesis of missing specifications and thus enables incremental design. In this paper, we consider a specification theory based on marked acceptance specifications (MAS) which are automata enriched with variability information encoded by acceptance sets and with reachability constrai...

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

The purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. This is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.

In [1] the authors considered finitely-valued modal logics with Kripke style semantics where both propositions and the accessibility relation are valued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy in general the normality axiom (K). In this paper we focus on the case of finite chains, and we consider a different approach based on introducing a multim...