How to find a function for calculating the number of well form brackets (for "n" pairs of brackets) using generating function? This is a probably a routine problem for some people, but I haven't got any resource on generating function.
Find a function for well form brackets using generating functions
1
$\begingroup$
generating-functions
-
0What are well formed brackets? A series of parentheses that have the same number of opens as closes? Wouldn't that just be $\binom {2n}{n}$ for a string $2n$ long? – 2011-05-13
-
6A must read on generating functions is Wilf's book www.math.upenn.edu/~wilf/gfology2.pdf – 2011-05-13
-
3@Ross: Probably it means that you at any stage must have more left than right brackets, in which case the answer is given by the Catalan numbers. – 2011-05-13
-
0@Hans: I think you are right. – 2011-05-13