Sciweavers

    CSL
    2008
    Springer
    140views Automated Reasoning» more  CSL 2008»

    The Descriptive Complexity of Parity Games

    14 years 1 months ago
    The Descriptive Complexity of Parity Games
    Download  www.logic.rwth-aachen.de
    We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in the modal
    Anuj Dawar, Erich Grädel
    claim paper
    Added 19 Oct 2010
    Updated 19 Oct 2010
    Type Conference
    Year 2008
    Where CSL
    Authors Anuj Dawar, Erich Grädel
    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.