Sciweavers

    JUCS
    2010
    112views more  JUCS 2010»

    A Note on the P-completeness of Deterministic One-way Stack Language

    13 years 2 months ago
    A Note on the P-completeness of Deterministic One-way Stack Language
    Download  www.jucs.org
    : The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
    Klaus-Jörn Lange
    claim paper
    Related Content
    Added 29 Jan 2011
    Updated 29 Jan 2011
    Type Journal
    Year 2010
    Where JUCS
    Authors Klaus-Jörn Lange
    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.