Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Lecture Notes in Computer Science;A. Aiken,1991
2. Andersen, N.: Approximating term rewriting systems with tree grammars. Technical Report 86/16, Institute of Datalogy, University of Copenhagen, (1986)
3. Lecture Notes in Computer Science;M. Biehl,1997
4. Börstler, J., Möncke, U., Wilhelm, R.: Table compression for tree automata. ACM Transactions on Programming Languages and Systems 13(3), 295–314 (1991)
5. Bryant, R.E.: Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35, 677–691 (1986)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献