Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, andbackward-forwardbisimulations) between fuzzyautomatahavebeen introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of th...

We show that logical paradoxes based on self-reference (of which the Liar is the best known example) are equivalent to the non-existence of solutions to a numerical system of equations, the so-called truth-value equations. Furthermore, we show that in many cases a self-referential system which does not posses a crisp (Boolean) solution can be solved by expanding the solution set to include fuzz...

This paper addresses the data-ow analysis of access to arrays in recursive imperative programs. When no assumption is made on recursion predicates, only approximate (\fuzzy") ow information can be hoped for in the general case. However, we introduce a new data-ow framework, based on push-down automata and, equivalently, on context-free grammars, and show that this framework allows to describe t...

Berstel and Pin have characterized local languages by introducing local automaton. In this paper fuzzy local language is introduced and the fuzzy local languages recognized by partial fuzzy local automata in max-min and min-max compositions are studied. Some closure properties of fuzzy local languages are provided. Mathematics Subject Classification: 68Q45

A model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum autom...

Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of fo...