Active learning of nondeterministic finite state machines

DOI10.1155/2013/373265MaRDI QIDQ459826zbMATH OpenOpenAlexWikidataFDO

Authors Warawoot Pacharoen, Toshiaki Aoki, Pattarasinee Bhattarakosol, Athasit Surarerks

Publication date 13 October 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/373265

Mathematics Subject Classification ID

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

Recommendations

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Active learning for extended finite state machines
• Learning Regular Languages Using Nondeterministic Finite Automata
• Efficient learning of typical finite automata from random walks
• scientific article; zbMATH DE number 1281920

Cites work

• scientific article; zbMATH DE number 1670711 (Why is no real title available?)
• scientific article; zbMATH DE number 1283472 (Why is no real title available?)
• scientific article; zbMATH DE number 978906 (Why is no real title available?)
• scientific article; zbMATH DE number 1956591 (Why is no real title available?)
• scientific article; zbMATH DE number 2080060 (Why is no real title available?)
• scientific article; zbMATH DE number 1418458 (Why is no real title available?)
• A calculus of communicating systems
• Bounded Sequence Testing from Non-deterministic Finite State Machines
• Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
• Domain-specific optimization in automata learning.
• Inference of finite automata using homing sequences
• Insights to Angluin's learning
• Learning regular sets from queries and counterexamples
• Unambiguous automata inference by means of state-merging methods.
• Verification of evolving software via component substitutability analysis
• When won't membership queries help?

Cited in

(9)

• Insights to Angluin's learning
• FSM inference from long traces
• Learning probabilistic systems from tree samples
• Active learning for extended finite state machines
• Models of active learning in group-structured state spaces
• Model matching of switched asynchronous sequential machines via matrix approach
• Protocol state machine reverse engineering with a teaching-learning approach
• \(L^*\)-based learning of Markov decision processes
• Learning communicating state machines

This page was built for publication: Active learning of nondeterministic finite state machines

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