Learning deterministic finite automata from interleaved strings

DOI10.1007/978-3-642-15488-1_8zbMATH Open1291.68195OpenAlexW1550014776MaRDI QIDQ3588367FDOQ3588367

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

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

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)

Cited In (6)

• Compositional learning for interleaving parallel automata
• Title not available (Why is that?)
• Learning a Random DFA from Uniform Strings and State Information
• Learning infinite-word automata with loop-index queries
• Title not available (Why is that?)
• Efficient learning of typical finite automata from random walks

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)