Sciweavers

    127
    Voted
    LICS
    2009
    IEEE
    138views Automated Reasoning» more  LICS 2009»
    An Improved Lower Bound for the Complementation of Rabin Automata
    15 years 9 months ago
    An Improved Lower Bound for the Complementation of Rabin Automata
    Download  people.csail.mit.edu
    Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
    Yang Cai, Ting Zhang, Haifeng Luo
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.