Learning Transparent Data Automata

DOI10.1007/978-3-319-07734-5_8zbMath1410.68182OpenAlexW107790019MaRDI QIDQ5166760

Normann Decker, Peter Habermehl, Daniel Thoma, Martin Leucker

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)

Cites Work

• Unnamed Item
• On notions of regularity for data languages
• Learning regular sets from queries and counterexamples
• Finite-memory automata
• Inferring Canonical Register Automata
• Two-variable logic on data words
• Inferring Network Invariants Automatically
• A Fresh Approach to Learning Register Automata
• On the Synthesis of Finite-State Machines from Samples of Their Behavior

This page was built for publication: Learning Transparent Data Automata