Carregant...
Polynomial Identification of [Formula: see text]-Automata
We study identification in the limit using polynomial time and data for models of [Formula: see text]-automata. On the negative side we show that non-deterministic [Formula: see text]-automata (of types Büchi, coBüchi, Parity or Muller) can not be polynomially learned in the limit. On the positive s...
Guardat en:
| Publicat a: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Autors principals: | , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7480709/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45237-7_20 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|