Active learning techniques for pomset recognizers
From MaRDI portal
Cites work
- A Kleene theorem for higher-dimensional automata
- A new approach for active automata learning based on apartness
- Active automata learning as black-box search and lazy partition refinement
- Compositional active learning of synchronizing systems through automated alphabet refinement
- Compositional automata learning of synchronous systems
- Compositional learning for interleaving parallel automata
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Free shuffle algebras in language varieties
- scientific article; zbMATH DE number 1302032 (Why is no real title available?)
- scientific article; zbMATH DE number 1136090 (Why is no real title available?)
- scientific article; zbMATH DE number 2040913 (Why is no real title available?)
- scientific article; zbMATH DE number 795584 (Why is no real title available?)
- scientific article; zbMATH DE number 7799615 (Why is no real title available?)
- Inference of finite automata using homing sequences
- Learning pomset automata
- Learning regular sets from queries and counterexamples
- Modeling concurrency with partial orders
- Myhill-Nerode theorem for higher-dimensional automata
- On series-parallel pomset languages: rationality, context-freeness and automata
- Posets with interfaces as a model for concurrency
- Rationality in algebras with a series operation
- Series-parallel languages and the bounded-width property
- Testing Software Design Modeled by Finite-State Machines
- The Recognition of Series Parallel Digraphs
This page was built for publication: Active learning techniques for pomset recognizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317506)
