The Lattice-Valued Turing Machines and the Lattice-Valued Type 0 Grammars

Abstract

Purpose.The purpose of this paper is to study a class of the natural languages called the lattice-valued phrase structure languages, which can be generated by the lattice-valued type 0 grammars and recognized by the lattice-valued Turing machines.Design/Methodology/Approach.From the characteristic of natural language, this paper puts forward a new concept of the l-valued Turing machine. It can be used to characterize recognition, natural language processing, and dynamic characteristics.Findings.The mechanisms of both the generation of grammars for the lattice-valued type 0 grammar and the dynamic transformation of the lattice-valued Turing machines were given.Originality/Value.This paper gives a new approach to study a class of natural languages by using lattice-valued logic theory.