A probabilistic model of computing with words
Journal of Computer and System Sciences
Linguistic quantifiers modeled by Sugeno integrals
Artificial Intelligence
Ontological approach to development of computing with words based systems
International Journal of Approximate Reasoning
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
Grammar theory based on lattice-ordered monoid
Fuzzy Sets and Systems
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Linguistic quantifiers modeled by Sugeno integrals
Artificial Intelligence
Computing with words in decision making: foundations, trends and prospects
Fuzzy Optimization and Decision Making
Fuzzy regular languages over finite and infinite words
Fuzzy Sets and Systems
New directions in fuzzy automata
International Journal of Approximate Reasoning
Perceptual reasoning for perceptual computing: a similarity-based approach
IEEE Transactions on Fuzzy Systems
Computing with words for hierarchical decision making applied to evaluating a weapon system
IEEE Transactions on Fuzzy Systems - Special section on computing with words
IEEE Transactions on Fuzzy Systems - Special section on computing with words
A fuzzy Petri-nets model for computing with words
IEEE Transactions on Fuzzy Systems - Special section on computing with words
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Probabilistic automata for computing with words
Journal of Computer and System Sciences
A reconstruction decoder for computing with words
Information Sciences: an International Journal
Uncertainty degree and modeling of interval type-2 fuzzy sets: Definition, method and application
Computers & Mathematics with Applications
Hi-index | 0.00 |
Classical automata are formal models of computing with values. Fuzzy automata are generalizations of classical automata where the knowledge about the system's next state is vague or uncertain. It is worth noting that like classical automata, fuzzy automata can only process strings of input symbols. Therefore, such fuzzy automata are still (abstract) devices for computing with values, although a certain vagueness or uncertainty are involved in the process of computation. We introduce a new kind of fuzzy automata whose inputs are instead strings of fuzzy subsets of the input alphabet. These new fuzzy automata may serve as formal models of computing with words. We establish an extension principle from computing with values to computing with words. This principle indicates that computing with words can be implemented with computing with values with the price of a big amount of extra computations.