Brüggemann-Klein and Wood define a one-unambiguous regular language as a language that can be recognized by a deterministic Glushkov automaton. They give a procedure performed on the minimal DFA, the BW-test, to decide whether a language is one-unambiguous. Block determinism is an extension of one-unambiguity while considering non-empty words as symbols and prefix-freeness as determinism. A blo...

In a binary choice voting scenario, voters may have fuzzy preferences but are required to make crisp choices. In order to compare a crisp voting procedure with more general mechanisms of fuzzy preference aggregation, we first focus on the latter. We present a formulation of strategy-proofness in this setting and study its consequences. On one hand, we achieve an axiomatic recommendation of the ...

A locally threshold testable language L is a language with the property that for some nonnegative integers k and l, whether or not a word u is in the language L depends on (1) the preex and suux of the word u of length k?1 and (2) the set of intermediate substrings of length k of the word u where the sets of substrings occurring at least j times are the same, for j l. For given k and l the lang...

Abstract We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A automaton a weighted over semiring. called if number of accepting runs on every bounded by global constant. The asks whether given automaton, there exist many deterministic automata whose pointwise maximum equivalent to automaton.

The starting point of the paper is the (well-known)observation that the “classical” Rough Set Theory as introduced by PAWLAK is equivalent to the S5 Propositional Modal Logic where the reachability relation is an equivalence relation. By replacing this equivalence relation by an arbitrary binary relation (satisfying certain properties, for instance, reflexivity and transitivity) we shall obtain...

State reduction of fuzzy automata has been studied by many authors. All of them have dealt with classical fuzzy automata over the Gödel structure and reduction has been done using crisp equivalence relations. In [2, 3, 7] we have made several innovations. We have studied fuzzy automata over a more general structure of truth values, over a complete residuated lattice, we have shown that better r...

A Real-Time Optimization (RTO) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. Furthermore, the objective function is penalized by a fuzzified form of the key process constraints. To enable using conventional optimization techniques, the resulting fuzzy optimization problem is the...

When we deal with crisp data, it is very common to find the correlation between variables. Here, we propose a method to calculate the correlation coefficient for fuzzy data, but rather than defining the correlation on the intuitionistic fuzzy sets like most of the previous works, we adopt the method from central interval. This interval can be used as a crisp set approximation with respect to a ...

Fuzzy finite element analysis for static displacements of beam structures with fuzzy forces is considered in this paper. The material properties of the beams are taken as crisp. Fuzzy finite element analysis of static problem for the above structures converts the problem into fuzzy system of linear equations. As such the coefficient matrix and the right hand side vector become crisp and fuzzy r...

vendor selection is dominantly considered to be a multi attribute decision making (madm) problem, since the decision maker needs to evaluate suppliers simultaneously in different and even contrastive evaluation criteria. one shortcoming of madm methods is that they only compare alternatives with each other, and there is no comparison with the requirements of the buying company. a very efficient...