State hyperstructures of tree automata based on lattice-valued logic
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 52 (2018) no. 1, pp. 23-42

Voir la notice de l'article provenant de la source Numdam

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, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply L-valued tree automaton) is introduced along with several equivalence relations in the set of the states of an L-valued tree automaton. We obtain two main results from this study: one of the relations can lead to the creation of Kleene’s theorem for L-valued tree automata, and the other one leads to the creation of a minimal v-valued tree automaton that accepts the same language as the given one.

DOI : 10.1051/ita/2018004
Classification : 68Q70, 68Q45, 20N25, 20N20
Keywords: Tree automaton, lattice-valued logic, Kleene’s theorem, hypergroup, minimization

Ghorani, Maryam 1

1
@article{ITA_2018__52_1_23_0,
     author = {Ghorani, Maryam},
     title = {State hyperstructures of tree automata based on lattice-valued logic},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {23--42},
     publisher = {EDP-Sciences},
     volume = {52},
     number = {1},
     year = {2018},
     doi = {10.1051/ita/2018004},
     mrnumber = {3843153},
     zbl = {1400.68129},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2018004/}
}
TY  - JOUR
AU  - Ghorani, Maryam
TI  - State hyperstructures of tree automata based on lattice-valued logic
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2018
SP  - 23
EP  - 42
VL  - 52
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita/2018004/
DO  - 10.1051/ita/2018004
LA  - en
ID  - ITA_2018__52_1_23_0
ER  - 
%0 Journal Article
%A Ghorani, Maryam
%T State hyperstructures of tree automata based on lattice-valued logic
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2018
%P 23-42
%V 52
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita/2018004/
%R 10.1051/ita/2018004
%G en
%F ITA_2018__52_1_23_0
Ghorani, Maryam. State hyperstructures of tree automata based on lattice-valued logic. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 52 (2018) no. 1, pp. 23-42. doi: 10.1051/ita/2018004

Cité par Sources :