1 research outputs found

    Polynomial characteristic sets for DFA identification

    Get PDF
    [EN] We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence of data-driven grammatical inference algorithms. In this paper, we prove a sufficient condition that assures the existence of a characteristic sample whose size is polynomial with respect to the minimum DFA of the target language. © 2012 Elsevier B.V. All rights reserved.Work partially supported by the Spanish Ministerio de Economia y Competitividad under research project TIN2011-28260-C03-01 and Universidad Politecnica de Valencia grant PAID-2019-06-2011.García Gómez, P.; López Rodríguez, D.; Vázquez-De-Parga Andrade, M. (2012). Polynomial characteristic sets for DFA identification. Theoretical Computer Science. 448:41-46. https://doi.org/10.1016/j.tcs.2012.04.042S414644
    corecore