String / Parenthesis (Bibtex)

P372: Enumeration of all well-formed parenthesis with length $2n$

Input:

An integer $n$.

Output:

All well-formed parenthesis with length $2n$ in lexicographical ordering.

Complexity:

Comment:

Reference:

[Er1983] (Bibtex)

P314: Enumeration of all well-formed parenthesis strings of size $n$

Input:

An integer $n$.

Output:

All well-formed parenthesis strings of size $n$.

Complexity:

$O(1)$ delay with $O(n)$ space, or $O(n)$ delay with $O(1)$ space.

Comment:

Reference:

[Walsh1998] (Bibtex)