The lattice-valued Turing machines and the lattice-valued type 0 grammars
type: Item
instance of: scholarly article
title: The lattice-valued Turing machines and the lattice-valued type 0 grammars
zbMATH Open document ID: 1407.68499
DOI: 10.1155/2014/291870
author: Xianqiang Yang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68T50
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 7016092
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/291870
OpenAlex ID: W2043341562
Wikidata QID: Q59065517
cites work: A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
cites work: Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
cites work: Fuzzy automata and languages
cites work: Fuzzy and probabilistic programs
cites work: Q4157953
cites work: On covering of products of fuzzy finite state machines
cites work: Fuzzy recognizers and recognizable sets
cites work: The Cartesian composition of fuzzy finite state machines
cites work: On subsystems of a fuzzy finite state machine
cites work: Admissible Partitions of Fuzzy Finite State Machines
cites work: Products of fuzzy finite state machines
cites work: Q4791753
cites work: Q5331549
cites work: Q5592246
Recommended article: Q5698578
Recommended article: Q4809448
Recommended article: On LC(0) grammars and languages
Recommended article: Lattice valued relations and automata
Recommended article: Automata theory based on complete residuated lattice-valued logic: Turing machines
Recommended article: Lattice-valued general orthomodular automata
Recommended article: Q2968333
Recommended article: Q5368011
Recommended article: Q3691084
Recommended article: Q3072259
description: scientific article; zbMATH DE number 7016092