Grammar Rewriting
暂无分享,去创建一个
[1] Jesse B. Wright,et al. Algebraic Automata and Context-Free Sets , 1967, Inf. Control..
[2] Dexter Kozen,et al. Complexity of finitely presented algebras , 1977, STOC '77.
[3] Robert E. Shostak,et al. An algorithm for reasoning about equality , 1977, CACM.
[4] Robert E. Tarjan,et al. Variations on the Common Subexpression Problem , 1980, J. ACM.
[5] Greg Nelson,et al. Fast Decision Procedures Based on Congruence Closure , 1980, JACM.
[6] Paul Chew,et al. An improved algorithm for computing with equations , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[7] Hélène Kirchner,et al. Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..
[8] Michaël Rusinowitch,et al. On Word Problems in Equational Theories , 1987, ICALP.
[9] L. Bachmair,et al. Completion without Failure 1 , 1989 .
[10] Gerald E. Peterson,et al. Complete Sets of Reductions with Constraints , 1990, CADE.
[11] Franz Baader. Rewrite Systems for Varieties of Semigroups , 1990, CADE.
[12] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.