Sciweavers

    MST
    2006
    129views more  MST 2006»
    Reachability Problems on Regular Ground Tree Rewriting Graphs
    13 years 11 months ago
    Reachability Problems on Regular Ground Tree Rewriting Graphs
    Download  www-i7.informatik.rwth-aachen.de
    We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
    Christof Löding
    claim paper
    Read More »
    MFCS
    2007
    Springer
    110views Theoretical Computer Science» more  MFCS 2007»
    Transition Graphs of Rewriting Systems over Unranked Trees
    14 years 5 months ago
    Transition Graphs of Rewriting Systems over Unranked Trees
    Download  www-i7.informatik.rwth-aachen.de
    We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
    Christof Löding, Alex Spelten
    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.