Learning deterministic finite automata from interleaved strings

DOI10.1007/978-3-642-15488-1_8MaRDI QIDQ3588367zbMATH OpenOpenAlexFDO

Authors Joshua Y. L. Jones, Tim Oates

Publication date 10 September 2010

Published in Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15488-1_8

zbMATH Keywords

regular languageslearning in the limitinterleaved languagesworkflow inference

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Recommendations

• Learning workflow Petri nets
• Learning workflow Petri nets
• Efficient learning of typical finite automata from random walks
• Principles for interactive acquisition and validation of workflows
• scientific article; zbMATH DE number 1966553

Cited in

(6)

• Learning infinite-word automata with loop-index queries
• Efficient learning of typical finite automata from random walks
• scientific article; zbMATH DE number 6999908 (Why is no real title available?)
• scientific article; zbMATH DE number 2019606 (Why is no real title available?)
• Learning a Random DFA from Uniform Strings and State Information
• Compositional learning for interleaving parallel automata

This page was built for publication: Learning deterministic finite automata from interleaved strings

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