Author:
Latteux Michel,Lemay Aurélien,Roos Yves,Terlutte Alain
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Inference of reversible languages;Angluin;J. ACM,1982
2. C. Choffrut, J. Karhumäki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook on Formal Languages, Vol. I, Springer, Berlin, Heidelberg, New York, 1997.
3. F. Denis, A. Lemay, A. Terlutte, Residual finite state automata, in: STACS 2001, 18th Annu. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 2010, Springer, Berlin, 2001, pp. 144–157.
4. F. Denis, A. Lemay, A. Terlutte, Some language classes identifiable in the limit from positive data, in: ICGI 2002, Lecture Notes in Artificial Intelligence, Vol. 2484, Springer, Berlin, 2002, pp. 63–76.
5. Learning regular languages using rfsas;Denis;Theoret. Comput. Sci.,2004
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reversible pushdown automata;Journal of Computer and System Sciences;2012-11
2. Some Minimality Results on Biresidual and Biseparable Automata;Language and Automata Theory and Applications;2010
3. On the Use of Non-deterministic Automata for Presburger Arithmetic;CONCUR 2010 - Concurrency Theory;2010
4. Minimal NFA and biRFSA Languages;RAIRO - Theoretical Informatics and Applications;2008-05-23