題組內容

3. Let Σ= [0, 1] be an alphabet and A = [1, 00, 10] be a subset of Σ*.

(a) For each integer n ≥ 1, let an be the number of strings in A* of length n. Find and solve a recurrence relation for .