A lattice-valued model of computing with words

Author

Xu, Fang ; Shu, Lan ; Cheng, Wei

Author_Institution

Sch. of Appl. Math., Univ. of Electron. Sci. & Technol. of China, Chengdu, China

fYear

2005

fDate

30 Oct.-1 Nov. 2005

Firstpage

97

Lastpage

101

Abstract

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.

Keywords

finite automata; grammars; inference mechanisms; inference rule; lattice-valued finite state automata; lattice-valued regular grammars; Automata; Computational modeling; Computer science; Fuzzy logic; Fuzzy reasoning; Fuzzy sets; Mathematics; Natural languages; Probability distribution; Turing machines;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Language Processing and Knowledge Engineering, 2005. IEEE NLP-KE '05. Proceedings of 2005 IEEE International Conference on

Print_ISBN

0-7803-9361-9

Type

conf

DOI

10.1109/NLPKE.2005.1598714

Filename

1598714