2026/01/18 by Radu Cosmin Dumitru, Ryo Yoshinaka, Ayumi Shinohara · 1 voice
Computer Science · #cs.FL #cs.LG
paper · pdf · doi:10.48550/arxiv.2601.12621
arxiv published 2026/01/18 · arxiv updated 2026/06/29
It is well known that computing a minimum deterministic finite automaton consistent with a given set of positive and negative examples is NP-hard. Previous work has identified conditions on the input sample under which the problem becomes tractable or remains hard. In this paper, we study the computational complexity of the case where the input sample is prefix-closed. This formulation is equivalent to computing a minimum Moore machine consistent with observations along its runs. We show that the problem is NP-hard to approximate when the sample set consists of all prefixes of binary strings. Furthermore, we show that the problem remains NP-hard as a decision problem even when the sample set consists of the prefixes of a single binary string. Our argument also extends to the corresponding problem for Mealy machines.