Rakesh Verma. Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems. Fundamenta Informaticae, 92(1-2):145-168, 2009. [doi]
@article{Verma09, title = {Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems}, author = {Rakesh Verma}, year = {2009}, doi = {10.3233/FI-2009-0070}, url = {http://dx.doi.org/10.3233/FI-2009-0070}, tags = {term rewriting, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Verma09}, cites = {0}, citedby = {0}, journal = {Fundamenta Informaticae}, volume = {92}, number = {1-2}, pages = {145-168}, }