Subject
General Computer Science,Theoretical Computer Science
Reference9 articles.
1. Learning regular sets from queries and counter-examples;Angluin;Inform. and Comput.,1987
2. Learning one-counter languages in polynomial time;Berman;Proc. IEEE FOCS' 87,1987
3. The minimalization of tree automata;Brainerd;Inform. and Control,1968
4. An effective model for grammar inference;Crespi-Reghizzi,1972
Cited by
83 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast Deterministic Black-box Context-free Grammar Inference;Proceedings of the IEEE/ACM 46th International Conference on Software Engineering;2024-04-12
2. Inferring Symbolic Automata;Logical Methods in Computer Science;2023-04-20
3. A Categorical Framework for Learning Generalised Tree Automata;Coalgebraic Methods in Computer Science;2022
4. Active Learning for Deterministic Bottom-Up Nominal Tree Automata;Lecture Notes in Computer Science;2022
5. Learning Pomset Automata;Lecture Notes in Computer Science;2021