collaborators

1 paper

cs.FL2025

Languages of Words of Low Automatic Complexity Are Hard to Compute

Joey Chen, Bjørn Kjos-Hanssen, Ivan Koswara +2

The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). Fo…