Learning Pomset Automata
Open Access
- 23 March 2021
- book chapter
- Published by Springer Nature
- Vol. 12650, 510-530
Abstract
We extend the $$\mathtt {L}^{\!\star }$$ 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.
Keywords
This publication has 30 references indexed in Scilit:
- Concurrent Kleene Algebra2009
- Query Learning of Regular Tree Languages: How to Avoid Dead StatesTheory of Computing Systems, 2005
- Series–parallel languages and the bounded-width propertyTheoretical Computer Science, 2000
- On the Learnability of Infinitary Regular SetsInformation and Computation, 1995
- Learning context-free grammars from structural data in polynomial timeTheoretical Computer Science, 1990
- The equational theory of pomsetsTheoretical Computer Science, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- On Context-Free LanguagesJournal of the ACM, 1966
- Bounded Algol-Like LanguagesTransactions of the American Mathematical Society, 1964