Author:
Hendrix Joe,Ohsaki Hitoshi,Viswanathan Mahesh
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation 75, 87–106 (1987)
2. Lecture Notes in Computer Science;A. Armando,2005
3. Autebert, J., Berstel, J., Boasson, L.: Context-Free Languages and Push-Down Automata, Handbook of Formal Languages, vol. 1, pp. 111–174. Springer, Heidelberg (1997)
4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
5. Boichut, Y., Heám, P.-C., Kouchnarenko, O.: Automatic Verification of Security Protocols Using Approximations, technical report RR-5727, INRIA (October 2005)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献