Dana Angluin (1987):
Learning Regular Sets from Queries and Counterexamples.
Information and Computation 75(2),
pp. 87–106,
doi:10.1016/0890-5401(87)90052-6.
Dana Angluin, Sarah Eisenstat & Dana Fisman (2015):
Learning Regular Languages via Alternating Automata.
In: Proceedings of the 24th International Conference on Artificial Intelligence,
IJCAI'15.
AAAI Press,
pp. 3308–3314.
George Argyros & Loris D'Antoni (2018):
The Learnability of Symbolic Automata.
In: Computer Aided Verification (CAV 2018),
pp. 427–445,
doi:10.1007/978-3-319-63121-9_8.
George Argyros, Ioannis Stais, Aggelos Kiayias & Angelos D. Keromytis (2016):
Back in Black: Towards Formal, Black Box Analysis of Sanitizers and Filters.
In: IEEE Symposium on Security and Privacy (SP 2016),
pp. 91–109,
doi:10.1109/SP.2016.14.
Benedikt Bollig, Peter Habermehl, Carsten Kern & Martin Leucker (2008):
Angluin-Style Learning of NFA.
Technical Report LSV-08-28.
Laboratoire Spécification et Vérification.
Benedikt Bollig, Peter Habermehl, Carsten Kern & Martin Leucker (2009):
Angluin-Style Learning of NFA.
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence,
pp. 1004–1009.
François Denis, Aurélien Lemay & Alain Terlutte (2002):
Residual finite state automata.
Fundamenta Informaticae 51(4),
pp. 339–368.
François Denis, Aurélien Lemay & Alain Terlutte (2004):
Learning regular languages using RFSAs.
Theoretical Computer Science 313(2),
pp. 267–294,
doi:10.1016/j.tcs.2003.11.008.
Samuel Drews & Loris D'Antoni (2017):
Learning Symbolic Automata.
In: 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2017),
pp. 173–189,
doi:10.1007/978-3-662-54577-5_10.
Colin de la Higuera (2005):
A bibliographical study of grammatical inference.
Pattern Recognition 38(9),
pp. 1332–1348,
doi:10.1016/j.patcog.2005.01.003.
Falk Howar & Bernhard Steffen (2018):
Active Automata Learning in Practice - An Annotated Bibliography of the Years 2011 to 2016.
In: Machine Learning for Dynamic Software Analysis: Potentials and Limits,
pp. 123–148,
doi:10.1007/978-3-642-24580-0_15.
Malte Isberner, Falk Howar & Bernhard Steffen (2014):
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning.
In: Runtime Verification.
Springer International Publishing,
pp. 307–322,
doi:10.1007/978-3-642-21455-4_8.
M. Kearns & U. Vazirani (1994):
An introduction to computational learning theory.
The MIT Press,
doi:10.7551/mitpress/3897.001.0001.
Martin Leucker (2006):
Learning Meets Verification.
In: 5th International Symposium on Formal Methods for Components and Objects (FMCO 2006),
pp. 127–151,
doi:10.1007/978-3-540-74792-5_6.
Oded Maler & Irini-Eleftheria Mens (2017):
A Generic Algorithm for Learning Symbolic Automata from Membership Queries.
In: Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday.
Springer International Publishing,
pp. 146–169,
doi:10.1007/978-3-319-63121-9_8.
Tiziana Margaria, Oliver Niese, Harald Raffelt & Bernhard Steffen (2004):
Efficient test-based model generation for legacy reactive systems.
In: Ninth IEEE International High-Level Design Validation and Test Workshop,
pp. 95–100,
doi:10.1109/HLDVT.2004.1431246.
Irini-Eleftheria Mens & Oded Maler (2015):
Learning Regular Languages over Large Ordered Alphabets.
Logical Methods in Computer Science 11(3),
doi:10.2168/LMCS-11(3:13)2015.
Atsuyoshi Nakamura (2005):
An efficient query learning algorithm for ordered binary decision diagrams.
Inf. Comput. 201(2),
pp. 178–198,
doi:10.1016/j.ic.2005.05.003.
Ronald L. Rivest & Robert E. Schapire (1993):
Inference of Finite Automata Using Homing Sequences.
Information and Computation 103(2),
pp. 299–347,
doi:10.1006/inco.1993.1021.
Margus Veanes, Peli de Halleux & Nikolai Tillmann (2010):
Rex: Symbolic Regular Expression Explorer.
In: Third International Conference on Software Testing, Verification and Validation (ICST 2010),
pp. 498–507,
doi:10.1109/ICST.2010.15.
Gail Weiss, Yoav Goldberg & Eran Yahav (2018):
Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples.
In: Proceedings of the 35th International Conference on Machine Learning,
pp. 5244–5253.
eptcs@eptcs.org