Author:
Frohme Markus,Steffen Bernhard
Publisher
Springer International Publishing
Reference41 articles.
1. Aarts, F., et al.: Establishing basis for learning algorithms. Technical report, CCSd/HAL: e-articles server (based on gBUS) [http://hal.ccsd.cnrs.fr/oai/oai.php] (France), February 2010. http://hal.archives-ouvertes.fr/inria-00464671/en/
2. Lecture Notes in Computer Science;R Alur,2005
3. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th annual ACM Symposium on Theory of computing, pp. 202–211. ACM (2004)
4. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
5. Communications in Computer and Information Science;A Bennaceur,2013
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scalable Tree-based Register Automata Learning;Lecture Notes in Computer Science;2024
2. From Languages to Behaviors and Back;Lecture Notes in Computer Science;2022
3. Lifelong Learning of Reactive Systems in Practice;The Logic of Software. A Tasting Menu of Formal Methods;2022