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)
68Q45: Formal languages and automata
Related Items
Efficient regular grammatical inference for pattern recognition, 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, A comparative analysis of recent identification approaches for discrete-event systems, On the inference of Turing machines from sample computations, A formal power series approach to the construction of minimal fuzzy automata, Learning Meets Verification, Inference of tree automata from sample set of trees, APPROXIMATE, NON-DETERMINISTIC MODELLING OF BEHAVIOUR SEQUENCES