Cargando…
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...
Autores principales: | Angluin, Dana, Fisman, Dana, Shoval, Yaara |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7480709/ http://dx.doi.org/10.1007/978-3-030-45237-7_20 |
Ejemplares similares
-
Representation of [Formula: see text] -Bernstein polynomials in terms of [Formula: see text] -Jacobi polynomials
por: Soleyman, F, et al.
Publicado: (2017) -
On the [Formula: see text] -norm of Gegenbauer polynomials
por: Ferizović, Damir
Publicado: (2021) -
A note on [Formula: see text] -Bernstein polynomials and their applications based on [Formula: see text] -calculus
por: Agyuz, Erkan, et al.
Publicado: (2018) -
Pebble-Intervals Automata and FO[Formula: see text] with Two Orders
por: Labai, Nadia, et al.
Publicado: (2020) -
Observation of B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] and B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] decays
por: Tumasyan, A., et al.
Publicado: (2022)