The lattice-valued Turing machines and the lattice-valued type 0 grammars

DOI10.1155/2014/291870zbMath1407.68499OpenAlexW2043341562WikidataQ59065517 ScholiaQ59065517MaRDI QIDQ1718064

Xianqiang Yang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/291870

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
• Fuzzy and probabilistic programs
• Fuzzy automata and languages
• Products of fuzzy finite state machines
• On covering of products of fuzzy finite state machines
• Fuzzy recognizers and recognizable sets
• On subsystems of a fuzzy finite state machine
• Admissible Partitions of Fuzzy Finite State Machines
• The Cartesian composition of fuzzy finite state machines
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems

This page was built for publication: The lattice-valued Turing machines and the lattice-valued type 0 grammars