Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning

DOI10.1007/978-3-030-50995-8_1zbMath1511.68136MaRDI QIDQ6487258

Martin Tappler, Unnamed Author, Bernhard K. Aichernig

Publication date: 9 November 2022

Mathematics Subject Classification ID

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

Related Items (3)

Learning finite state models from recurrent neural networks ⋮ Active model learning of stochastic reactive systems ⋮ Compositional learning for interleaving parallel automata

Cites Work

• Unnamed Item
• Learning regular sets from queries and counterexamples
• Efficient active automata learning via mutation testing
• Inference of finite automata using homing sequences
• Testing Software Design Modeled by Finite-State Machines
• Benchmarks for automata learning and conformance testing

This page was built for publication: Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning