Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. D.Angluin. A note on the number of queries to identify regular languages. Information and Computation, 51:76–87, 1981.
2. D.Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87–106, 1987.
3. J.Barzdin, G.Barzdin, K.Apsitis, U.Sarkans. Towards efficient inductive synthesis of expressions from input/output examples. In Proc of th 4th Workshop on Algorithmic Learning Theory (ALT'93), Lect. Notes in Artific. Intel., Springer, 1993, 59–72.
4. A.Brazma. Efficient identification of regular expressions from representative examples. In Proc. of 6th Annual Workshop on Comput. Learn. Theory COLT'93, ACM Press, 1993, p.236–242.
5. A.Brazma, K.Cerans. Efficient learning of regular expressions from good examples. In proc. of 4th Intern. Workshop on Analogical and Inductive Inference (AII'94), Lecture Notes in Artificial Intelligence, Vol 872, 1994, pp.76–90.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Regex-Based Linkography Abstraction Refinement for Information Security;Proceedings of the Fourth ACM International Workshop on Security and Privacy Analytics;2018-03-21
2. Location Recognition with Fuzzy Grammar;Communications in Computer and Information Science;2012
3. Algorithms for learning regular expressions from positive data;Information and Computation;2009-04