Sciweavers

    FOCS
    1999
    IEEE
    89views Theoretical Computer Science» more  FOCS 1999»

    Regular Languages Are Testable with a Constant Number of Queries

    14 years 4 months ago
    Regular Languages Are Testable with a Constant Number of Queries
    Download  www.cs.tau.ac.il
    Noga Alon, Michael Krivelevich, Ilan Newman, Mario
    claim paper
    Added 03 Aug 2010
    Updated 03 Aug 2010
    Type Conference
    Year 1999
    Where FOCS
    Authors Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
    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.