A probabilistic model of computing with words
Journal of Computer and System Sciences
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
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
Information Sciences: an International Journal
Intelligent steganalytic system: application on natural language environment
WSEAS Transactions on Systems and Control
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Computing with words in decision making: foundations, trends and prospects
Fuzzy Optimization and Decision Making
Historical reflections and new positions on perceptual computing
Fuzzy Optimization and Decision Making
Fuzzy tree language recognizability
Fuzzy Sets and Systems
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
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
| Hi-index | 0.00 |
Computing with words (CW) as a methodology, means computing and reasoning by the use of words in place of numbers or symbols, which may conform more to humans' perception when describing real-world problems. In this paper, as a continuation of a previous paper, we aim to develop and deepen a formal aspect of CW. According to the previous paper, the basic point of departure is that CW treats certain formal modes of computation with strings of fuzzy subsets instead of symbols as their inputs. Specifically, 1) we elaborate on CW via Turing machine (TM) models, showing the time complexity is at least exponential if the inputs are strings of words; 2) a negative result of (6) not holding is verified which indicates that the extension principle for CW via TMs needs to be re-examined; 3) we discuss CW via context- free grammars and regular grammars and the extension principles for CW via these formal grammars are set up; 4) some equivalences between fuzzy pushdown automata (respectively, fuzzy finite-state automata) fuzzy context-free grammars (respectively, fuzzy regular grammars) are demonstrated in the sense that the inputs are instead strings of words; 5) some instances are described in detail. Summarily formal aspect of CW is more systematically established more deeply dealt with while some new problems also emerge.