Definition:Balanced String

Definition
Let $S$ be a string in an alphabet containing the left and right brackets $($ and $)$.

Then $S$ is said to be balanced iff it contains equally many left and right brackets.

Also see

 * WFF of PropLog is Balanced‎