Sciweavers

    DLT
    2009
    116views Theoretical Computer Science» more  DLT 2009»

    Strongly Regular Grammars and Regular Approximation of Context-Free Languages

    13 years 9 months ago
    Strongly Regular Grammars and Regular Approximation of Context-Free Languages
    Download  www.cs.ucsb.edu
    Abstract. We consider algorithms for approximating context
    Ömer Egecioglu
    claim paper
    Added 17 Feb 2011
    Updated 17 Feb 2011
    Type Journal
    Year 2009
    Where DLT
    Authors Ömer Egecioglu
    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.