Learning Transparent Data Automata

DOI10.1007/978-3-319-07734-5_8MaRDI QIDQ5166760zbMATH OpenOpenAlexFDO

Authors Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma

Publication date 8 July 2014

Published in Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07734-5_8

Mathematics Subject Classification ID

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

Recommendations

• Adaptively learning probabilistic deterministic automata from data streams
• Learning symbolic automata
• Automata Learning
• Automata Learning: A Categorical Perspective
• Learning automata with side-effects
• Publication:5753505

Cites work

• A fresh approach to learning register automata
• Finite-memory automata
• Inferring canonical register automata
• Inferring Network Invariants Automatically
• Learning regular sets from queries and counterexamples
• Learning workflow Petri nets
• On notions of regularity for data languages
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Two-variable logic on data words

Cited in

(4)

• A robust class of data languages and an application to learning
• Residuality and learning for nondeterministic nominal automata
• A fresh approach to learning register automata
• Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists

This page was built for publication: Learning Transparent Data Automata

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