Definition:Balanced String/Definition 1

Definition
Let $S$ be a string in an alphabet containing brackets.

$S$ is said to be balanced :
 * $(1): \quad S$ contains equally many left and right brackets.
 * $(2): \quad$ Every prefix of $S$ contains at least as many left brackets as it does right brackets.

Also see

 * Equivalence of Definitions of Balanced String