Automata Learning

DOI10.1145/3373718.3394775MaRDI QIDQ5145689zbMATH OpenOpenAlexFDO

Authors Henning Urbat, Lutz Schröder

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.00874

zbMATH Keywords

monadsalgebrasautomata learning

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(22)

• A categorical framework for learning generalised tree automata
• Learning automata with side-effects
• Combining semilattices and semimodules
• Learning pomset automata
• Dual adjunction between -automata and Wilke algebra quotients
• FaMoS -- fast model learning for hybrid cyber-physical systems using decision trees
• Recent advances in learning automata
• Learning automata and transducers: a categorical approach
• scientific article; zbMATH DE number 5848604 (Why is no real title available?)
• Enhancing Automata Learning by Log-Based Metrics
• Active learning of deterministic transducers with outputs in arbitrary monoids
• Active learning of deterministic transducers with outputs in arbitrary monoids
• Learning Transparent Data Automata
• Automata Learning: A Categorical Perspective
• Reverse Engineering Through Automata Learning
• Active learning for sound negotiations
• Complete test suites for automata in monoidal closed categories
• scientific article; zbMATH DE number 7471718 (Why is no real title available?)
• Automatic functions, linear time and learning
• scientific article; zbMATH DE number 4037208 (Why is no real title available?)
• Feasability of learning weighted automata on a semiring
• A new approach for active automata learning based on apartness

This page was built for publication: Automata Learning

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