Sciweavers

    234 search results - page 10 / 47
    » On Quasi-Products of Tree Automata
    Sort
    View
    DKE
    2006
    139views more  DKE 2006»
    Information extraction from structured documents using k-testable tree automaton inference
    15 years 6 months ago
    Information extraction from structured documents using k-testable tree automaton inference
    Download  alpha.uhasselt.be
    Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
    Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
    claim paper
    Read More »
    CAI
    2007
    Springer
    88views Information Technology» more  CAI 2007»
    Restarting Tree Automata and Linear Context-Free Tree Languages
    16 years 5 days ago
    Restarting Tree Automata and Linear Context-Free Tree Languages
    Download  www.theory.informatik.uni-kassel.de
    Heiko Stamer, Friedrich Otto
    claim paper
    Read More »
    DBPL
    2005
    Springer
    93views Database» more  DBPL 2005»
    Minimizing Tree Automata for Unranked Trees
    15 years 11 months ago
    Minimizing Tree Automata for Unranked Trees
    Download  lrb.cs.uni-dortmund.de
    Wim Martens, Joachim Niehren
    claim paper
    Read More »
    ACL
    2011
    178views Computational Linguistics» more  ACL 2011»
    Syntax-based Statistical Machine Translation using Tree Automata and Tree Transducers
    14 years 9 months ago
    Syntax-based Statistical Machine Translation using Tree Automata and Tree Transducers
    Download  www.aclweb.org
    Daniel Emilio Beck
    claim paper
    Read More »
    CSL
    2007
    Springer
    96views Automated Reasoning» more  CSL 2007»
    MSO on the Infinite Binary Tree: Choice and Order
    15 years 10 months ago
    MSO on the Infinite Binary Tree: Choice and Order
    Download  www-i7.informatik.rwth-aachen.de
    We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
    Arnaud Carayol, Christof Löding
    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.