- #1
EvLer
- 458
- 0
Can someone check this problem, please?
problem:
give a recursive definition for the set of strings of well-balanced parentheses:
my solution:
1. a set of single parentheses ()
2. nesting of strings already in the set
3. any concatenation of the strings already in the set
thanks in advance.
problem:
give a recursive definition for the set of strings of well-balanced parentheses:
my solution:
1. a set of single parentheses ()
2. nesting of strings already in the set
3. any concatenation of the strings already in the set
thanks in advance.