Learning pomset automata
From MaRDI portal
Publication:2233430
DOI10.1007/978-3-030-71995-1_26OpenAlexW3142037944MaRDI QIDQ2233430FDOQ2233430
Authors: Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2102.07504
Recommendations
Cites Work
- Learning regular sets from queries and counterexamples
- Bounded Algol-Like Languages
- On Context-Free Languages
- The Recognition of Series Parallel Digraphs
- The equational theory of pomsets
- Series-parallel languages and the bounded-width property
- Concurrent Kleene Algebra
- Title not available (Why is that?)
- Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
- Learning context-free grammars from structural data in polynomial time
- On the learnability of infinitary regular sets
- Distributional learning of some context-free languages with a minimally adequate teacher
- Title not available (Why is that?)
- Query learning of regular tree languages: How to avoid dead states
- Learning I/O automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognisable languages over monads
- Automata Learning
- Learning the Language of Error
- Learning weighted automata over principal ideal domains
- Angluin learning via logic
- On series-parallel pomset languages: rationality, context-freeness and automata
- Concurrent Kleene algebra: free model and completeness
- Title not available (Why is that?)
- Learning pomset automata
- Generating Posets Beyond N
- Eilenberg Theorems for Free
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Learning pomset automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233430)