Sciweavers

    BIRTHDAY
    2004
    Springer
    65views Applied Computing» more  BIRTHDAY 2004»

    A Proof of Regularity for Finite Splicing

    14 years 5 months ago
    A Proof of Regularity for Finite Splicing
    Download  profs.sci.univr.it
    We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
    Vincenzo Manca
    claim paper
    Added 01 Jul 2010
    Updated 01 Jul 2010
    Type Conference
    Year 2004
    Where BIRTHDAY
    Authors Vincenzo Manca
    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.