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...

Descripción completa

Detalles Bibliográficos
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