Sciweavers

    FUIN
    2010
    98views more  FUIN 2010»

    A Note on Two-pebble Automata Over Infinite Alphabets

    13 years 8 months ago
    A Note on Two-pebble Automata Over Infinite Alphabets
    Download  homepages.inf.ed.ac.uk
    It is shown that the emptiness problem for 2-PA languages is undecidable and that 2-PA are weaker than 3-PA.
    Michael Kaminski, Tony Tan
    claim paper
    Added 02 Mar 2011
    Updated 02 Mar 2011
    Type Journal
    Year 2010
    Where FUIN
    Authors Michael Kaminski, Tony Tan
    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.