2021
DOI: 10.48550/arxiv.2102.07504
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 24 publications
(45 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?