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
3
search results - page 1 / 1
»
Introduction to Rewriting
Sort
relevance
views
votes
recent
update
View
thumb
title
21
click to vote
RTA
2007
Springer
84
views
Theoretical Computer Science
»
more
RTA 2007
»
Proving Termination of Rewrite Systems Using Bounds
14 years 1 months ago
Download
cl-informatik.uibk.ac.at
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
claim paper
Read More »
20
click to vote
LFCS
1997
Springer
82
views
Artificial Intelligence
»
more
LFCS 1997
»
Type Introduction for Equational Rewriting
13 years 11 months ago
Download
staff.aist.go.jp
Hitoshi Ohsaki, Aart Middeldorp
claim paper
Read More »
10
click to vote
AC
1993
Springer
77
views
Software Engineering
»
more
AC 1993
»
Introduction to Rewriting
13 years 11 months ago
Download
web.cecs.pdx.edu
Jean-Pierre Jouannaud
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »