Sciweavers

    2 search results - page 1 / 1
    » The Simplest Language Where Equivalence of Finite Substituti...
    Sort
    View
    79
    Voted
    FCT
    2007
    Springer
    63views Applied Computing» more  FCT 2007»
    The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
    15 years 9 months ago
    The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
    Download  www.math.muni.cz
    Michal Kunc
    claim paper
    Read More »
    131
    Voted
    IEICET
    2008
    67views more  IEICET 2008»
    Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
    15 years 3 months ago
    Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
    Download  colus.i.kyushu-u.ac.jp
    We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
    Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.