Polynomial characteristic sets for DFA identification
[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 s...
| Authors: | , , |
|---|---|
| Format: | article |
| Publication Date: | 2012 |
| Country: | España |
| Institution: | Universitat Politècnica de València (UPV) |
| Repository: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Language: | English |
| OAI Identifier: | oai:riunet.upv.es:10251/37983 |
| Online Access: | https://riunet.upv.es/handle/10251/37983 |
| Access Level: | Open access |
| Keyword: | DFA identification Grammatical inference Grammatical inferences Target language Algorithms LENGUAJES Y SISTEMAS INFORMATICOS |
| Summary: | [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. |
|---|