Learning Pomset Automata
Gerco van Heerdt, Tobias Kapp\'e, Jurriaan Rot, Alexandra Silva
TL;DR
This paper extends the L* algorithm to learn bimonoids that recognize pomset languages, and establishes a correspondence between bimonoids and a specific class of pomset automata, enabling conversion between the two.
Contribution
It introduces a novel extension of the L* algorithm for bimonoids and characterizes a class of pomset automata recognizing the same languages.
Findings
Extension of L* algorithm to bimonoids
Identification of pomset automata class
Conversion methods between bimonoids and automata
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · semigroups and automata theory · Machine Learning and Algorithms