| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952472 | Theoretical Computer Science | 2016 | 7 Pages |
Abstract
We address the classic problem of polynomial computation of a minimal finite-state representation compatible with two finite input sets that contain those strings that have to be accepted and rejected. We extend the previously defined uniformly-complete sample and prove that it is a special case of the sufficient condition we propose.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Manuel Vázquez de Parga, Pedro GarcÃa, Damián López,