Fundamental results for learning deterministic extended finite state machines from queries

DOI10.1016/J.TCS.2020.09.028MaRDI QIDQ1998871zbMATH OpenOpenAlexFDO

Authors Florentin Ipate, Raluca Lefticaru, Marian Gheorghe

Publication date 9 March 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.09.028

zbMATH Keywords

3DFAextended finite state machinesfinite automatalearning from queriesX-machines

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1008506
• scientific article; zbMATH DE number 1281920
• Learning finite cover automata from queries
• Active learning for extended finite state machines
• scientific article; zbMATH DE number 5957212
• Learning probabilistic automata and Markov chains via queries
• Learning commutative deterministic finite state automata in polynomial time

Cites work

• A unified integration and component testing approach from deterministic stream X-machine specifications
• Automated assumption generation for compositional verification
• Automated formal analysis and verification: an overview
• Checking experiments for stream X-machines
• Computing with membranes
• Domain-specific optimization in automata learning.
• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1200754 (Why is no real title available?)
• scientific article; zbMATH DE number 1735632 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Inferring Network Invariants Automatically
• Learning finite cover automata from queries
• Learning Minimal Separating DFA’s for Compositional Verification
• Learning regular sets from queries and counterexamples
• Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
• Testing against a non-controllable stream X-machine using state counting
• Testing based on identifiable P systems using cover automata and X-machines
• Testing data processing-oriented systems from stream X-machine models
• Testing methods for X-machines: a review
• Transforming communicating X-machines into P systems

Cited in

(3)

• FSM inference from long traces
• Learning finite cover automata from queries
• Active learning for extended finite state machines

This page was built for publication: Fundamental results for learning deterministic extended finite state machines from queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998871)