Sciweavers

    LATA
    2010
    Springer
    174views Artificial Intelligence» more  LATA 2010»

    Pregroup Grammars with Letter Promotions

    14 years 8 months ago
    Pregroup Grammars with Letter Promotions
    Download  www.staff.amu.edu.pl
    We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
    Wojciech Buszkowski, Zhe Lin
    claim paper
    Added 02 Mar 2010
    Updated 02 Mar 2010
    Type Conference
    Year 2010
    Where LATA
    Authors Wojciech Buszkowski, Zhe Lin
    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.