Learning pomset automata

DOI10.1007/978-3-030-71995-1_26OpenAlexW3142037944MaRDI QIDQ2233430

Gerco van Heerdt, Alexandra Silva, Tobias Kappé, Jurriaan Rot

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2102.07504

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Learning pomset automata ⋮ A categorical framework for learning generalised tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Query learning of regular tree languages: How to avoid dead states
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• The equational theory of pomsets
• Series-parallel languages and the bounded-width property
• Angluin learning via logic
• On series-parallel pomset languages: rationality, context-freeness and automata
• On the learnability of infinitary regular sets
• Learning weighted automata over principal ideal domains
• Learning pomset automata
• Concurrent Kleene algebra: free model and completeness
• Concurrent Kleene Algebra
• Recognisable Languages over Monads
• Learning the Language of Error
• Learning I/O Automata
• Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
• The Recognition of Series Parallel Digraphs
• Generating Posets Beyond N
• Eilenberg Theorems for Free
• Automata Learning
• Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
• Bounded Algol-Like Languages
• On Context-Free Languages

This page was built for publication: Learning pomset automata