Lataa...
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...
Tallennettuna:
| Julkaisussa: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Päätekijät: | , , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
2020
|
| Aiheet: | |
| Linkit: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7480709/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45237-7_20 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|