Wil M. P. van der Aalst (2012):
Process mining.
CACM 55(8),
pp. 76–83,
doi:10.1145/2240236.2240257.
Dana Angluin (1987):
Learning Regular Sets from Queries and Counterexamples.
Inf. Comput. 75(2),
pp. 87–106,
doi:10.1016/0890-5401(87)90052-6.
Dana Angluin & Philip D. Laird (1987):
Learning From Noisy Examples.
Mach. Learn. 2(4),
pp. 343–370,
doi:10.1023/A:1022873112823.
Alan W. Biermann & Jerome A. Feldman (1972):
A survey of results in grammatical inference.
In: S. Watanabe: Frontiers of Pattern Recognition.
Academic Press, New York,
pp. 31–54,
doi:10.1016/B978-0-12-737140-5.50007-5.
Christos G. Cassandras & Stephane Lafortune (2010):
Introduction to Discrete Event Systems.
Springer Publishing Company, Incorporated,
doi:10.1007/978-0-387-68612-7.
E Mark Gold (1978):
Complexity of automaton identification from given data.
Information and Control 37(3),
pp. 302 – 320,
doi:10.1016/S0019-9958(78)90562-4.
Wassily Hoeffding (1963):
Probability Inequalities for Sums of Bounded Random Variables.
Journal of the American Statistical Association 58(301),
pp. 13–30,
doi:10.2307/2282952.
Michael J. Kearns (1998):
Efficient Noise-Tolerant Learning from Statistical Queries.
J. ACM 45(6),
pp. 983–1006,
doi:10.1145/293347.293351.
Michael J. Kearns & Umesh V. Vazirani (1994):
An Introduction to Computational Learning Theory.
MIT Press,
doi:10.7551/mitpress/3897.001.0001.
J. R. Quinlan (1986):
The Effect of Noise on Concept Learning.
In: Machine Learning, An Artificial Intelligence Approach Volume II, chapter 6.
Morgan Kaufmann,
pp. 149–166.
Ray J. Solomonoff (1964):
A Formal Theory of Inductive Inference.
Inf. Control. 7(1, 2),
pp. 1–22, 224–254,
doi:10.1016/S0019-9958(64)90223-2.
Leslie G. Valiant (1984):
A Theory of the Learnable.
Commun. ACM 27(11),
pp. 1134–1142,
doi:10.1145/1968.1972.
R. M. Wharton (1974):
Approximate language identification.
Information and Control 26(3),
pp. 236 – 255,
doi:10.1016/S0019-9958(74)91369-2.
eptcs@eptcs.org