Learning pomset automata

DOI10.1007/978-3-030-71995-1_26MaRDI QIDQ2233430OpenAlexFDO

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

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• Learning nominal automata
• Automata Learning: A Categorical Perspective
• Learning automata with side-effects
• Learning Meets Verification
• Learning of finite coded Petri net languages

Cites work

• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 1302032 (Why is no real title available?)
• scientific article; zbMATH DE number 2040913 (Why is no real title available?)
• scientific article; zbMATH DE number 2143010 (Why is no real title available?)
• scientific article; zbMATH DE number 7407791 (Why is no real title available?)
• Angluin learning via logic
• Automata Learning
• Bounded Algol-Like Languages
• Brzozowski goes concurrent -- a Kleene theorem for pomset languages
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Concurrent Kleene Algebra
• Concurrent Kleene algebra: free model and completeness
• Distributional learning of some context-free languages with a minimally adequate teacher
• Eilenberg Theorems for Free
• Generating Posets Beyond N
• Learning I/O automata
• Learning context-free grammars from structural data in polynomial time
• Learning pomset automata
• Learning regular sets from queries and counterexamples
• Learning the Language of Error
• Learning weighted automata over principal ideal domains
• On Context-Free Languages
• On series-parallel pomset languages: rationality, context-freeness and automata
• On the learnability of infinitary regular sets
• Query learning of regular tree languages: How to avoid dead states
• Recognisable languages over monads
• Series-parallel languages and the bounded-width property
• The Recognition of Series Parallel Digraphs
• The equational theory of pomsets

Cited in

(6)

• Myhill-Nerode theorem for higher-dimensional automata
• Active learning for sound negotiations
• Compositional automata learning of synchronous systems
• A Myhill-Nerode theorem for higher-dimensional automata
• A categorical framework for learning generalised tree automata
• Learning pomset automata

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)