The lattice-valued Turing machines and the lattice-valued type 0 grammars (Q1718064)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The lattice-valued Turing machines and the lattice-valued type 0 grammars |
scientific article; zbMATH DE number 7016092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The lattice-valued Turing machines and the lattice-valued type 0 grammars |
scientific article; zbMATH DE number 7016092 |
Statements
The lattice-valued Turing machines and the lattice-valued type 0 grammars (English)
0 references
8 February 2019
0 references
Summary: \textit{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. \textit{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. \textit{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. \textit{Originality/Value.} This paper gives a new approach to study a class of natural languages by using lattice-valued logic theory.
0 references
0 references
0 references
0.8700088
0 references
0.8659083
0 references