Generation of Forests of Trees Split into Patterns

  • Laurent Alonso
  • René Schott
Chapter

Abstract

We present a linear algorithm which generates randomly and with uniform probability many kinds of trees: binary trees, ternary trees, arbitrary trees, forests of p k-ary trees,.... The algorithm is based on the definition of a generic kind of tree which can be coded in the form of words. These words, in turn, can easily be generated.

Keywords

Binary Tree Cyclic Permutation Language Versus Linear Algorithm Dominance Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Laurent Alonso
    • 1
  • René Schott
    • 1
  1. 1.CRINUniversité Henri PoincaréFrance

Personalised recommendations