Fundamental results for learning deterministic extended finite state machines from queries

DOI10.1016/j.tcs.2020.09.028zbMath1497.68234OpenAlexW3087272834MaRDI QIDQ1998871

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

finite automataX-machinesextended finite state machineslearning from queries3DFA

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified integration and component testing approach from deterministic stream X-machine specifications
• Learning finite cover automata from queries
• Automated assumption generation for compositional verification
• Testing data processing-oriented systems from stream X-machine models
• Checking experiments for stream X-machines
• Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
• Learning regular sets from queries and counterexamples
• Computing with membranes
• Testing based on identifiable P systems using cover automata and X-machines
• Testing against a non-controllable stream X-machine using state counting
• Testing methods for X-machines: a review
• Transforming communicating X-machines into P systems
• Automated formal analysis and verification: an overview
• Inferring Network Invariants Automatically
• Learning Minimal Separating DFA’s for Compositional Verification
• Computer Aided Verification

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