Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
click to vote
AAECC
2010
Springer
favorite
Email
discuss
report
124
views
Algorithms
»
more
AAECC 2010
»
A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
13 years 11 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision