A (restricted) Dyck language consist of "well-formed" or "balanced" strings over a finite number of pairs of parentheses.
the string ( [ ( ) ( ) ] { } [ ] ) ( ) is in the Dyck language over three pairs of parentheses (see Berstel 1979 for a more detailed presentation).