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
26
search results - page 6 / 6
»
rta 2010
Sort
relevance
views
votes
recent
update
View
thumb
title
26
click to vote
RTA
2010
Springer
133
views
Theoretical Computer Science
»
more
RTA 2010
»
Termination of linear bounded term rewriting systems
14 years 19 days ago
Download
drops.dagstuhl.de
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
Irène Durand, Géraud Sénizerg...
claim paper
Read More »
« Prev
« First
page 6 / 6
Last »
Next »