Learning Pomset Automata

We extend the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {L}^{\!\star }$$\end{document}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.

[1]  Alexander Clark,et al.  Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher , 2010, ICGI.

[2]  Bernhard Steffen,et al.  Active Automata Learning in Practice - An Annotated Bibliography of the Years 2011 to 2016 , 2018, Machine Learning for Dynamic Software Analysis.

[3]  Georg Struth,et al.  Concurrent Kleene Algebra , 2009, CONCUR.

[4]  Bernhard Steffen,et al.  The Open-Source LearnLib - A Framework for Active Automata Learning , 2015, CAV.

[5]  Bernhard Steffen,et al.  The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning , 2014, RV.

[6]  Bas Luttik,et al.  On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata , 2018, J. Log. Algebraic Methods Program..

[7]  Alexandra Silva,et al.  Concurrent Kleene Algebra: Free Model and Completeness , 2017, ESOP.

[8]  Frank Drewes,et al.  Learning a Regular Tree Language from a Teacher , 2003, Developments in Language Theory.

[9]  Gerco van Heerdt.  Efficient Inference of Mealy Machines , 2014 .

[10]  Pascal Weil,et al.  Series-parallel languages and the bounded-width property , 2000, Theor. Comput. Sci..

[11]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[12]  Jirí Adámek,et al.  Eilenberg Theorems for Free , 2016, MFCS.

[13]  Georg Struth,et al.  Generating Posets Beyond N , 2019, RAMiCS.

[14]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[15]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[16]  Bas Luttik,et al.  Equivalence checking for weak bi-Kleene algebra , 2018, ArXiv.

[17]  Frank Drewes,et al.  Query Learning of Regular Tree Languages: How to Avoid Dead States , 2005, Theory of Computing Systems.

[18]  Frits W. Vaandrager,et al.  Model learning , 2017, Commun. ACM.

[19]  Amir Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT '91.

[20]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[21]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[22]  Zoltán Ésik,et al.  Higher Dimensional Automata , 2002, J. Autom. Lang. Comb..

[23]  Frits W. Vaandrager,et al.  Learning I/O Automata , 2010, CONCUR.

[24]  Bas Luttik,et al.  Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages , 2017, CONCUR.

[25]  Georg Struth,et al.  Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages , 2014, RAMiCS.

[26]  Clemens Kupke,et al.  Angluin Learning via Logic , 2018, LFCS.

[27]  Daniel Kroening,et al.  Learning the Language of Error , 2015, ATVA.

[28]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[29]  Yasubumi Sakakibara,et al.  Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.

[30]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[31]  Mikolaj Bojanczyk,et al.  Recognisable Languages over Monads , 2015, DLT.

[32]  Pascal Weil,et al.  A Kleene Iteration for Parallelism , 1998, FSTTCS.