A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems


Journal article


Julian Zinn, Rakesh M. Verma
Appl. Algebra Eng. Commun. Comput., vol. 21, 2010, pp. 459--485

Cite

Cite

APA   Click to copy
Zinn, J., & Verma, R. M. (2010). A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems. Appl. Algebra Eng. Commun. Comput., 21, 459–485.


Chicago/Turabian   Click to copy
Zinn, Julian, and Rakesh M. Verma. “A Polynomial Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems.” Appl. Algebra Eng. Commun. Comput. 21 (2010): 459–485.


MLA   Click to copy
Zinn, Julian, and Rakesh M. Verma. “A Polynomial Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems.” Appl. Algebra Eng. Commun. Comput., vol. 21, 2010, pp. 459–85.


BibTeX   Click to copy

@article{zinn2010a,
  title = {A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems},
  year = {2010},
  journal = {Appl. Algebra Eng. Commun. Comput.},
  pages = {459--485},
  volume = {21},
  author = {Zinn, Julian and Verma, Rakesh M.}
}