Active learning of nondeterministic finite state machines

DOI10.1155/2013/373265zbMATH Open1296.68096OpenAlexW2123884022WikidataQ59024126 ScholiaQ59024126MaRDI QIDQ459826FDOQ459826

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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
• \(L^*\)-based learning of Markov decision processes
• Learning communicating state machines
• Protocol state machine reverse engineering with a teaching-learning approach

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)