Grammar-oriented enumeration of arbitrary trees and arbitrary k-ary trees

IEICE Transactions on Information and Systems

Volumn E82-D, Issue 9, 1999, Pages 1245-1253

  Xiang, Limin ^a   Ushijima, Kazuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

Enumeration; Grammar; K ary trees; Lexicographic; Trees

Indexed keywords

BINARY CODES; CONTEXT FREE GRAMMARS;

BINARY TREES;

TREES (MATHEMATICS);

EID: 0033185258     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. V. Bapiraju and V.V.B. Rao, "Enumeration of binary trees," Inf. Process. Lett., vol.51, pp.125-127, 1991.
2. D.R. van Baronaigien, "A loopless algorithm for generating binary tree sequences," Inf. Process. Lett., vol.39, pp. 189-194, 1991.
3. D.R. van Baronaigien and F. Ruskey, "Generating t-ary Trees in A-order," Inf. Process. Lett., vol.27, pp.205-213, 1988.
4. M.C. Er, "Enumerating ordered trees lexicographically," Comput. J., vol.28, no.5, pp.538-542, 1985.
5. M.C. Er, "Efficient generation of k-ary trees in natural order," Comput. J., vol.35, no.3, pp.306-308,1992.
6. J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
7. G.D. Knott, "A numbering system for binary trees," Commun. ACM, vol.20, no.2, pp.113-115, 1977.
8. D.E. Knuth, The Art of Computer Programming, vol.1, Fundamental Algorithms, Third Edition, Addison-Wesley, Reading, Mass., 1997.
9. J.F. Korsh, "Loopless generation of k-ary tree sequences," Inf. Process. Lett., vol.52, pp.243-247, 1994.
10. J.M. Lucas, D.R. van Baronaigien, and F. Ruskey, "On rotations and the generation of binary trees," J. Algorithms, vol.15, pp.343-366, 1993.
11. J.M. Pallo, "Enumerating, ranking and unranking binary trees," Comput. J., vol.29, no.2, pp.171-175, 1986.
12. J.M. Pallo and R. Racca, "A note on generating binary trees in A-order and B-order," Intern. J. Computer Math., vol.18, pp.27-39, 1985.
13. A. Proskurowski, "On the generation for binary trees," J. ACM, vol.27, no.1, pp.1-2, 1980.
14. D. Rotem and Y.L. Varol, "Generation of binary trees from Ballot sequences," J. ACM, vol.25, no.3, pp.396-404, 1978.
15. M. Solomon and R.A. Finkel, "A note on enumerating binary trees," J. ACM, vol.27, no.1, pp.3-5, 1980.
16. L. Xiang, C. Tang, and K. Ushijima, "Grammar-oriented enumeration of binary trees," Comput. J., vol.40, no.5, pp.278-291, 1997.
17. L. Xiang and K. Ushijima, "Iterative formulas for enumerating binary trees," Research Rep. on Inform. Sci. and Elect. Engin, of Kyushu Univ., vol.2, no.2, pp.179-183, 1997.
18. S. Zaks, "Lexicographic generation of ordered trees," Theoretical Comput. Sci., vol.10, no.1, pp.63-82, 1980.
19. D. Zerling, "Generating binary trees using rotations," J. ACM, vol.32, no.3, pp.694-701, 1985.