Sciweavers

    CSR
    2007
    Springer
    100views Theoretical Computer Science» more  CSR 2007»
    Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
    14 years 5 months ago
    Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
    Download  users.utu.fi
    Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
    Artur Jez, Alexander Okhotin
    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.