Can I read Enumerative Sequences of Leaves and Nodes in Rational Trees on EtoBox?

Enumerative Sequences of Leaves and Nodes in Rational Trees by Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin is a Computer Science article available to read on EtoBox.

What is Enumerative Sequences of Leaves and Nodes in Rational Trees about?

We prove that any M-rational sequence s = (sn)n>\_,~ of nonnegative integers satisfying the Kraft strict inequality ~-]~n~> i snk-n < 1 is the enumerative sequence of leaves by height of a rational kary tree. We give an efficient algorithm to get a k-ary rational tree. Particular cases of this result had been previously proven. We give some partial results in the case of equality. Especially we study the similar problem of characterizing the enumerative sequences of nodes of k-ary rational trees and solve this question when the sequence has a primitive linear representation. ~) 1999 Elsevier Science B.V. All rights reserved.

Who reads Enumerative Sequences of Leaves and Nodes in Rational Trees?

Author

Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)

Published

1999

Language

EN

Field

Computer Science (Physical Sciences)