Sciweavers

    RTA
    2005
    Springer
    197views Theoretical Computer Science» more  RTA 2005»
    On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
    14 years 1 months ago
    On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
    Download  www.imn.htwk-leipzig.de
    We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
    Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.