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

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 characteristi...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2014-01, Vol.2014 (2014), p.1-6
Main Authors: Tang, Juan, Tang, Jian-Gang, Fang, Yong
Format: Article
Language:English
Subjects:
Algebra
Character recognition
Dynamic characteristics
Dynamics
Grammar
Grammars
Hypotheses
Language
Lattice design
Mathematical analysis
Mathematical problems
Natural language processing
Physics
Power plants
Recognition
Studies
Transformations
Turing machines
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1024-123X
1563-5147
DOI:10.1155/2014/291870