Author:
Busch Daniel,Nolte Gerrit,Bainczyk Alexander,Steffen Bernhard
Publisher
Springer Nature Switzerland
Reference32 articles.
1. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. In: ACM Transactions on Programming Languages and Systems, vol. 8, no. 2, pp. 244–263 (1986). https://doi.org/10.1145/5397.5399
2. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987). https://doi.org/10.1016/0890-5401(87)90052-6
3. Burkholder, P.: Alcuin of York’s propositiones ad acuendos juvenes: introduction, commentary & translation. Hist. Sci. Technol. Bull. 1(2) (1993)
4. Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. Cambridge, MA, USA (1994). ISBN: 0-262-11193-4
5. Balcázar, J.L., Dýéaz, J., Gavaldá, R.: Algorithms for learning finite automata from queries: a unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53–72 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. AI Assisted Programming;Bridging the Gap Between AI and Reality;2023-12-14