Cargando…
Learning Pomset Automata
We extend the [Formula: see text] algorithm to learn bimonoids recognising pomset languages. We then identify a class of pomset automata that accepts precisely the class of pomset languages recognised by bimonoids and show how to convert between bimonoids and automata.
Autores principales: | van Heerdt, Gerco, Kappé, Tobias, Rot, Jurriaan, Silva, Alexandra |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984277/ http://dx.doi.org/10.1007/978-3-030-71995-1_26 |
Ejemplares similares
-
Learning Weighted Automata over Principal Ideal Domains
por: van Heerdt, Gerco, et al.
Publicado: (2020) -
Improving Symbolic Automata Learning with Concolic Execution
por: Clun, Donato, et al.
Publicado: (2020) -
Learning One-Clock Timed Automata
por: An, Jie, et al.
Publicado: (2020) -
Automata
por: Hopkin, David, et al.
Publicado: (1976) -
Distributive laws for monotone specifications
por: Rot, Jurriaan
Publicado: (2019)