Sciweavers

    ICALP
    2009
    Springer
    163views Programming Languages» more  ICALP 2009»
    Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
    14 years 11 months ago
    Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
    Download  www.kb.ecei.tohoku.ac.jp
    Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
    Naoki Kobayashi, C.-H. Luke Ong
    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.