$A_N()=1$ (the length is 0 and the complexity deficiency is 0).
Witnessing sequence of states: 0
The witnessing automaton happens to be deterministic.
You may also be interested in:
Complexity of the empty string
$A_N()=1$ (the length is 0 and the complexity deficiency is 0).
Witnessing sequence of states: 0
You may also be interested in: