scientific article; zbMATH DE number 3493901

MaRDI QIDQ4076799zbMATH OpenFDO

Authors Yasuyoshi Inagaki, Teruo Fukumura

Publication date 1975

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)

Cited in

(10)

• Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
• A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
• Fuzzy tree automata
• Characterizations of complete residuated lattice-valued finite tree automata
• State hyperstructures of tree automata based on lattice-valued logic
• Coding tree languages based on lattice-valued logic
• scientific article; zbMATH DE number 7644294 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076799)