The objective of this paper is to introduce a method for constructing a minimal lattice-valued
tree automaton with membership values in a totally ordered lattice (in short LTA), LTA) …

In this paper, we study a new generalization for the notion of fuzzy automata, which we
called typical hesitant fuzzy automata. First, we present the formulations of the mathematics …

In this paper, we introduce the concept of lattice-valued tree pushdown automata that
extends the concepts of lattice-valued pushdown automata, lattice-valued tree automata and …

In this paper, an association is organized between the theory of tree automata on one hand
and the hyperstructures on the other hand, over complete residuated lattices. To this end …

In this paper, we study fuzzy top-down tree automata over lattices (LTA s, for short). The
purpose of this contribution is to investigate the minimization problem for LTA s. We first …

The current study aims to investigate the L-valued tree automata theory based on t-norm/t-
conorm and it further examines their algebraic and L-valued topological properties …

In this paper, we introduce the concept of non-deterministic tree automata based on
quantum-valued logic whose underlying structure is a complete orthomodular lattice. First …

Inspired by nondeterministic fuzzy finite automata theory proposed by Cao and Ezawa, we
define general-nondeterministic fuzzy pushdown automata (GN-FPDAs). For a GN-FPDA …

In this paper we investigate fuzzy tree automata. Fuzzy tree automata extend fuzzy
automata. In fuzzy automata we deal with strings and in fuzzy tree automata we utilize trees …

در اﯾﻦ ﻣﻘﺎﻟﻪ، ﺑﻪ ﺑﺮرﺳﯽ اﺗﻮﻣﺎﺗﺎی درﺧﺘﯽ ﻓﺎزی ﻣﯽﭘﺮدازﯾﻢ. ﯾﮏ زﺑﺎن درﺧﺖ ﻓﺎزی ﻣﺮﺣﻠﻪای ﺗﺸﺨﯿﺺﭘﺬﯾﺮ را ﺗﻌﺮﯾﻒ ﮐﺮده و ﻧﺸﺎن
ﻣﯽدﻫﯿﻢ ﻫﺮ زﺑﺎن درﺧﺖ ﻓﺎزی ﺗﺸﺨﯿﺺﭘﺬﯾﺮ ﯾﮏ زﺑﺎن درﺧﺖ ﻓﺎزی ﻣﺮﺣﻠﻪای ﺗﺸﺨﯿﺺﭘﺬﯾﺮ اﺳﺖ. در اداﻣ ﻪ، ﯾ ﮏ اﺗ ﻮﻣ ﺎﺗ ﻮن درﺧﺘ …‎