A lattice-valued model of computing with words

Computing with words, as a methodology, means computing and reasoning by the use of words in place of numbers or symbols. In this paper, we deal with computing with words via lattice-valued finite state automata and lattice-valued regular grammars. Specifically, 1) we show that computing with words via lattice-valued finite state automata can be implemented with computing with values via lattice-valued finite state automata; 2) we show that computing with words via lattice-valued regular grammars can be implemented with computing with values via lattice-valued regular grammars; 3) the equivalence between lattice-valued finite state automata and lattice-valued regular grammars are demonstrated.