Sciweavers

    FSTTCS
    2008
    Springer
    109views Software Engineering» more  FSTTCS 2008»

    The Complexity of Tree Transducer Output Languages

    14 years 1 months ago
    The Complexity of Tree Transducer Output Languages
    Download  www.cse.unsw.edu.au
    Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class is NP-complete.
    Kazuhiro Inaba, Sebastian Maneth
    claim paper
    Added 09 Nov 2010
    Updated 09 Nov 2010
    Type Conference
    Year 2008
    Where FSTTCS
    Authors Kazuhiro Inaba, Sebastian Maneth
    Comments (0)
    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.