On the Synthesis of Finite-State Machines from Samples of Their Behavior
From MaRDI portal
Publication:5655299
DOI10.1109/TC.1972.5009015zbMath0243.94039MaRDI QIDQ5655299
No author found.
Publication date: 1972
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
The inference of tree languages from finite samples: An algebraic approach, A formal power series approach to the construction of minimal fuzzy automata, Inferring regular languages and \(\omega\)-languages, Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships, Generating grammars for SGML tagged texts lacking DTD, Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3, Enhancing active model learning with equivalence checking using simulation relations, Research in the theory of inductive inference by GDR mathematicians - A survey, Structural reconfiguration of systems under behavioral adaptation, Learning Meets Verification, Unnamed Item, A comparative analysis of recent identification approaches for discrete-event systems, Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning, Regular inference as vertex coloring, Learning Transparent Data Automata, Input–output identification of controlled discrete manufacturing systems, FSM inference from long traces, Regular \(\omega\)-languages with an informative right congruence, Inference for regular bilanguages, Structural pattern recognition, homomorphisms, and arrangements, APPROXIMATE, NON-DETERMINISTIC MODELLING OF BEHAVIOUR SEQUENCES, A beam search algorithm for PFSA inference, Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference, On the inference of Turing machines from sample computations, Mining State-Based Models from Proof Corpora, Efficient regular grammatical inference for pattern recognition, Inference of tree automata from sample set of trees, A Survey of Opponent Modeling in Adversarial Domains
