Complexity of Normal Form Properties and Reductions for Term Rewriting Problems


Journal article


Rakesh M. Verma
Fundam. Informaticae, vol. 92, 2009, pp. 145--168

Cite

Cite

APA   Click to copy
Verma, R. M. (2009). Complexity of Normal Form Properties and Reductions for Term Rewriting Problems . Fundam. Informaticae, 92, 145–168.


Chicago/Turabian   Click to copy
Verma, Rakesh M. “Complexity of Normal Form Properties and Reductions for Term Rewriting Problems .” Fundam. Informaticae 92 (2009): 145–168.


MLA   Click to copy
Verma, Rakesh M. “Complexity of Normal Form Properties and Reductions for Term Rewriting Problems .” Fundam. Informaticae, vol. 92, 2009, pp. 145–68.


BibTeX   Click to copy

@article{verma2009a,
  title = {Complexity of Normal Form Properties and Reductions for Term Rewriting Problems },
  year = {2009},
  journal = {Fundam. Informaticae},
  pages = {145--168},
  volume = {92},
  author = {Verma, Rakesh M.}
}