Author:
Chen Taolue,Fokkink Wan,Nain Sumit
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Aceto, L., Fokkink, W.J., van Glabbeek, R.J., Ingolfsdottir, A.: Nested semantics over finite trees are equationally hard. Information and Computation 191(2), 203–232 (2004)
2. Lecture Notes in Computer Science;S.C.C. Blom,2003
3. Lecture Notes in Computer Science;W.J. Fokkink,2000
4. Lecture Notes in Computer Science;W.J. Fokkink,2004
5. Lecture Notes in Computer Science;W.J. Fokkink,2005
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献