paper

Learning Pomset Automata

arXiv:2102.07504 · doi:10.1007/978-3-030-71995-1_26

Abstract

We extend the L* 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.

References in corpus (4)

Cited by in corpus (1)