FSM inference from long traces

DOI10.1007/978-3-319-95582-7_6zbMath1460.68082OpenAlexW2809142577MaRDI QIDQ2024336

Florent Avellaneda, Alexandre Petrenko

Publication date: 4 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-319-95582-7_6

zbMATH Keywords

SAT solvermachine identificationmachine inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• Model learning as a satisfiability modulo theories problem
• Learning Moore machines from input-output traces
• Inferring Network Invariants Automatically
• Inference of Sequential Machines from Sample Computations
• Complexity of automaton identification from given data
• Sequential Machine Identification
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Language identification in the limit
• Efficient algorithms for the inference of minimum size DFAs

This page was built for publication: FSM inference from long traces