no. 3
Yield-languages recognized by alternating tree recognizers
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 3, pp. 319-339. 
@article{ITA_1988__22_3_319_0,
     author = {Salomaa, Kai},
     title = {Yield-languages recognized by alternating tree recognizers},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {319--339},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {3},
     year = {1988},
     mrnumber = {963595},
     zbl = {0656.68087},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1988__22_3_319_0/}
}
TY  - JOUR
AU  - Salomaa, Kai
TI  - Yield-languages recognized by alternating tree recognizers
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1988
SP  - 319
EP  - 339
VL  - 22
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1988__22_3_319_0/
LA  - en
ID  - ITA_1988__22_3_319_0
ER  - 
%0 Journal Article
%A Salomaa, Kai
%T Yield-languages recognized by alternating tree recognizers
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 319-339
%V 22
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1988__22_3_319_0/
%G en
%F ITA_1988__22_3_319_0
Salomaa, Kai. Yield-languages recognized by alternating tree recognizers. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 3, pp. 319-339. http://www.numdam.org/item/ITA_1988__22_3_319_0/

1. A. Aho, Indexed Grammars. An Extension of Context-free Grammars, J. Assoc. Comput. Mach., Vol. 15, 1968, pp. 647-671. | MR | Zbl

2. A. K. Chandra, D. C. Kozen and L. J. Stockmeyer, Alternation, J. Assoc. Comput. Mach., Vol. 28, 1981, pp. 114-133. | MR | Zbl

3. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984. | MR | Zbl

4. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Language, and Computation, Addison-Wesley, 1979. | MR | Zbl

5. R. E. Ladner, R. J. Lipton and L. J. Stockmeyer, Alternating Pushdown and Stack Automata, SIAM J. Comput., Vol. 13, 1984, pp. 135-155. | MR | Zbl

6. D. E. Muller, A. Saoudi and P. E. Schupp, Alternating Automata, the Weak Monadic Theory of the Tree, and its Complexity, Proc. of 13th ICALP, Lect. Notes Comput. Sci., Vol. 226, 1986, pp. 275-283. | MR | Zbl

7. M. Penttonen, One-sided and Two-sided Context in Formal Grammars, Inf. Control, Vol. 25, 1974, pp. 371-392. | MR | Zbl

8. W. C. Rounds, Mappings and Grammars on Trees, Math. Systems Theory, Vol. 4, 1970, pp. 257-287. | MR | Zbl

9. A. Salomaa, Formal Languages, Academic Press, NewYork, 1973. | MR | Zbl

10. K. Salomaa, Alternating Botton-up Tree Recognizers, Proc. of llth CAAP, Lect. Notes Comput. Sci., Vol. 214, 1986, pp. 158-171. | MR | Zbl

11. G. Slutzki, Alternating Tree Automa, Proc. of 8th CAAP, Lect. Notes Comput. Sci., Vol. 159, 1983, pp. 392-404. | MR | Zbl