Coding tree languages based on lattice-valued logic-Reference-Cited by-同舟云学术

Coding tree languages based on lattice-valued logic

Published:2016-01-30 Issue:14 Volume:21 Page:3815-3825
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

Ghorani M.,Zahedi M. M.

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Link

http://link.springer.com/article/10.1007/s00500-016-2031-3/fulltext.html

Reference36 articles.

1. Abolpour KH, Zahedi MM (2012) Isomorphism between two BL-general fuzzy automata. Soft Comput 16(4):729–736

2. Birkhoff G (1984) Lattice theory. American Mathematical Society, Providence

3. Bozapalidis S, Bozapalidoy OL (2010) Fuzzy tree language recognizability. Fuzzy Sets Syst 161:716–734

4. Comon H, Dauchet M, Gilleron R, Jacquemard F, Lugiez D, Loding C, Tison S, Tommasi M (2007) Tree automata: technigues and applications. http://tata.gforge.inria.fr

5. Doner JE (1965) Decidability of the weak second-order theory of two successors. Not Am Math Soc 12:365–468

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On L-valued tree automata: The topological characterization;Journal of Intelligent & Fuzzy Systems;2023-01-30

2. A Theorem on Supports of Weighted Tree Automata Over Strong Bimonoids;New Mathematics and Natural Computation;2022-09-30

3. Lattice-valued tree pushdown automata: Pumping lemma and closure properties;International Journal of Approximate Reasoning;2022-03

4. Characterization of Tree Automata Based on Quantum Logic;International Journal of Theoretical Physics;2022-02

5. Decidability of the minimization of fuzzy tree automata with membership values in complete lattices;Journal of Applied Mathematics and Computing;2021-03-31