scientific article; zbMATH DE number 3493901
From MaRDI portal
Publication:4076799
zbMATH Open0315.68064MaRDI QIDQ4076799FDOQ4076799
Authors: Yasuyoshi Inagaki, Teruo Fukumura 
Publication date: 1975
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)
Cited In (10)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- 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
- Title not available (Why is that?)
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)
