Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

85

Voted

AAECC
2010
Springer

favoriteEmaildiscussreport

124views Algorithms» more AAECC 2010»

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

15 years 14 days ago

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

Download www.cs.uh.edu

Julian Zinn, Rakesh M. Verma

Real-time Traffic

AAECC 2010 | Algorithms |

claim paper

Related Content

» Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems

» Adding constants to string rewriting

» Operational and Axiomatic Semantics of PCF

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	AAECC
Authors	Julian Zinn, Rakesh M. Verma

Comments (0)