Sciweavers

    DLT
    2008
    96views Theoretical Computer Science» more  DLT 2008»

    Provably Shorter Regular Expressions from Deterministic Finite Automata

    14 years 1 months ago
    Provably Shorter Regular Expressions from Deterministic Finite Automata
    Download  www.informatik.uni-giessen.de
    Hermann Gruber, Markus Holzer
    claim paper
    Added 29 Oct 2010
    Updated 29 Oct 2010
    Type Conference
    Year 2008
    Where DLT
    Authors Hermann Gruber, Markus Holzer
    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.