Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dumitru, Radu Cosmin, Yoshinaka, Ryo, Shinohara, Ayumi
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2601.12621