%0 Journal Article
%T Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
%J Iranian Journal of Fuzzy Systems
%I University of Sistan and Baluchestan
%Z 1735-0654
%A Ghorani, Maryam
%A Zahedi, Mohammad Mehdi
%D 2016
%\ 04/30/2016
%V 13
%N 2
%P 71-94
%! Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
%K Lattice-valued logic
%K Alternating top-down tree automaton
%K State alternating regular tree grammar
%K Alternating stack tree automaton
%R 10.22111/ijfs.2016.2360
%X In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is taken over to prove a main theorem: the class of languages generated by an {L}valued alternating regular tree grammar {LAG}) is equal to the class of languages accepted by an {L}valued alternating top-down tree automaton {LAA}). The second way is taken over to define a new type of automaton by combining the {L}valued alternating top-down tree automaton with stack, called {L}-valued alternating stack tree automaton {LASA} and the generative power of it is compared to some well-known language classes, especially to {LAA} and to {LAG}Also, we have derived a characterization of the state alternating regular tree grammar {LSAG}) in terms of {LASA}.
%U https://ijfs.usb.ac.ir/article_2360_9a374f39abaa600423ce805945586dd1.pdf