Results on the use of category theory for the study of lattice-valued finite state machines

DOI10.1016/j.ins.2014.06.027zbMath1355.18002OpenAlexW1973731665MaRDI QIDQ508741

Juan Tang, Jian-Gang Tang, Mao-Kang Luo

Publication date: 8 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.06.027

zbMATH Keywords

functorcategory of L-fuzzy finite state machinescategory of L-fuzzy quasi-transformation monoidscategory of L-fuzzy quasi-transformation semigroupscategory of L-fuzzy transformation monoidscategory of L-fuzzy transformation semigroups

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (3)

On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED ⋮ Categories of quantale-valued fuzzy automata: determinization and minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
• Fuzzy automata and languages
• Products of fuzzy finite state machines
• On prime and primary fuzzy ideals and their radicals
• 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: Results on the use of category theory for the study of lattice-valued finite state machines