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
27
click to vote
RTA
1997
Springer
favorite
Email
discuss
report
108
views
Theoretical Computer Science
»
more
RTA 1997
»
Innocuous Constructor-Sharing Combinations
14 years 20 days ago
Download
www.cs.tau.ac.il
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is left-linear and convergent.
Nachum Dershowitz
Real-time Traffic
Hierarchical Combinations
|
Rewrite Systems
|
RTA 1997
|
Theoretical Computer Science
|
claim paper
Related Content
»
Detecting Word Substitutions in Text
»
Saner Composing Static and Dynamic Analysis to Validate Sanitization in Web Applications
more »
Post Info
More Details (n/a)
Added
08 Aug 2010
Updated
08 Aug 2010
Type
Conference
Year
1997
Where
RTA
Authors
Nachum Dershowitz
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision