Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete. - Radu Cosmin Dumitru; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2026)