tree generation
From: Jaroslaw Zola (_cut_this_zola_at_icis.pcz.pl)
Date: 10/26/04
- Next message: André Betz: "Turing Machine to Train Sets Converter"
- Previous message: Torben Ćgidius Mogensen: "Re: Testing for acceptance of Kleene closure of alphabet"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 26 Oct 2004 16:36:54 +0200
Hi,
I am looking for efficient algorithm to generate all possible
rooted binary trees with k leafs. I assume list representation.
Moreover, tree like (x,y) is equal to (y,x). I will appreciate any help.
Best regards,
j.zola
PS. I hope it is right group to send this question.
- Next message: André Betz: "Turing Machine to Train Sets Converter"
- Previous message: Torben Ćgidius Mogensen: "Re: Testing for acceptance of Kleene closure of alphabet"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]