Sciweavers

    BIRTHDAY
    2008
    Springer
    123views Applied Computing» more  BIRTHDAY 2008»

    Tree Automata over Infinite Alphabets

    14 years 1 months ago
    Tree Automata over Infinite Alphabets
    Download  www.cs.technion.ac.il
    A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare their computation power.
    Michael Kaminski, Tony Tan
    claim paper
    Added 12 Oct 2010
    Updated 12 Oct 2010
    Type Conference
    Year 2008
    Where BIRTHDAY
    Authors Michael Kaminski, Tony Tan
    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.