Complexity lookup

$A_N()=1$ (the length is 0 and the complexity deficiency is 0).

Witnessing sequence of states: 0

Graphviz Engine:
The witnessing automaton happens to be deterministic.

You may also be interested in:


Complexity of the empty string

Professor of Mathematics, University of Hawaii at Manoa