Sciweavers

    STACS
    2009
    Springer
    89views Theoretical Computer Science» more  STACS 2009»
    Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
    14 years 6 months ago
    Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
    Download  hal.archives-ouvertes.fr
    Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
    Daniel Kirsten, Sylvain Lombardy
    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.