Learning symbolic automata
From MaRDI portal
Recommendations
Cites work
- Active learning for extended finite state machines
- Learning nominal automata
- Learning regular languages over large ordered alphabets
- Learning Regular Languages Using Nondeterministic Finite Automata
- Learning regular sets from queries and counterexamples
- Minimization of symbolic automata
- Sigma*
- Synthesis of interface specifications for Java classes
Cited in
(42)- Inferring regular languages and \(\omega\)-languages
- Regular \(\omega\)-languages with an informative right congruence
- Inferring switched nonlinear dynamical systems
- The power of symbolic automata and transducers
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Learning automata with side-effects
- Symbolic automata for static specification mining
- Symbolic automata: the toolkit
- Sigma*
- Learning regular languages over large ordered alphabets
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Minimization of symbolic tree automata
- Query learning algorithm for residual symbolic finite automata
- Learning one-clock timed automata
- Improving Symbolic Automata Learning with Concolic Execution
- CALF: categorical automata learning framework
- Theoretical aspects of symbolic automata
- Polynomial identification of \(\omega \)-automata
- Learning Transparent Data Automata
- A generic algorithm for learning symbolic automata from membership queries
- Applications of symbolic finite automata
- Learning nominal automata
- Fast computations on ordered nominal sets
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- The learnability of symbolic automata
- Automated programming, symbolic computation, machine learning: my personal view
- Active automata learning as black-box search and lazy partition refinement
- Inferring symbolic automata
- Inferring Symbolic Automata
- Active learning of one-clock timed automata using constraint solving
- Learning and characterizing fully-ordered lattice automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Reverse Engineering Through Automata Learning
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
- Learning deterministic variable automata over infinite alphabets
- Learning automata and transducers: a categorical approach
- Active learning of symbolic Mealy automata
- Variable automata over infinite alphabets
- Feasability of learning weighted automata on a semiring
- Constructing concise characteristic samples for acceptors of omega regular languages
- \(SL^{\lambda}\): a scalable algorithm for register automata learning
- Active learning of symbolic mealy automata
This page was built for publication: Learning symbolic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303893)
