On the Synthesis of Finite-State Machines from Samples of Their Behavior
From MaRDI portal
Cited in
(36)- Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Inference for regular bilanguages
- Structural pattern recognition, homomorphisms, and arrangements
- A beam search algorithm for PFSA inference
- The inference of tree languages from finite samples: An algebraic approach
- Generating grammars for SGML tagged texts lacking DTD
- Inferring regular languages and \(\omega\)-languages
- Structural reconfiguration of systems under behavioral adaptation
- A comparative analysis of recent identification approaches for discrete-event systems
- FSM inference from long traces
- Regular \(\omega\)-languages with an informative right congruence
- On the inference of Turing machines from sample computations
- A formal power series approach to the construction of minimal fuzzy automata
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Learning Meets Verification
- Inference of tree automata from sample set of trees
- APPROXIMATE, NON-DETERMINISTIC MODELLING OF BEHAVIOUR SEQUENCES
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Regular inference as vertex coloring
- Parallel algorithms for minimal nondeterministic finite automata inference
- A survey of opponent modeling in adversarial domains
- Learning Transparent Data Automata
- Input-output identification of controlled discrete manufacturing systems
- Mining state-based models from proof corpora
- Enhancing active model learning with equivalence checking using simulation relations
- Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach
- A new approach for active automata learning based on apartness
- Learning communicating state machines
- Analyzing robustness of Angluin's L^* algorithm in presence of noise
- Constructing deterministic parity automata from positive and negative examples
- Unsupervised automata learning via discrete optimization
- FlexFringe: modeling software behavior by learning probabilistic automata
- Towards a formal digital twin of the PTP protocol using automata learning
- Efficient regular grammatical inference for pattern recognition
This page was built for publication: On the Synthesis of Finite-State Machines from Samples of Their Behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5655299)
