Active learning of nondeterministic finite state machines

DOI10.1155/2013/373265zbMath1296.68096OpenAlexW2123884022WikidataQ59024126 ScholiaQ59024126MaRDI QIDQ459826

Pattarasinee Bhattarakosol, Toshiaki Aoki, Athasit Surarerks, Warawoot Pacharoen

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

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

Related Items (1)

Model matching of switched asynchronous sequential machines via matrix approach

Cites Work

• Verification of evolving software via component substitutability analysis
• Learning regular sets from queries and counterexamples
• A calculus of communicating systems
• When won't membership queries help?
• Inference of finite automata using homing sequences
• Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
• Bounded Sequence Testing from Non-deterministic Finite State Machines
• Machine Learning: ECML 2003
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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