intTypePromotion=4
ADSENSE

Linear context-free rewriting systems

Xem 1-2 trên 2 kết quả Linear context-free rewriting systems
  • We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified righthand-side nonterminal (the head) and add the remaining nonterminals one at a time in any order. We show that it is NP-hard to find the best head-driven strategy in terms of either the time or space complexity of parsing.

    pdf10p hongdo_1 12-04-2013 27 1   Download

  • We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. From equivalences that have previously been established we know that this class of languages is also equal to the string languages generated by context-free hypergraph grammars, multicomponent tree-adjoining grammars, and multiple contextfree grammars and to the class of yields of images of the regular tree languages under finite-copying topdown tree transducers. ...

    pdf8p bunmoc_1 20-04-2013 26 1   Download

CHỦ ĐỀ BẠN MUỐN TÌM

TOP DOWNLOAD
180 tài liệu
1241 lượt tải
ADSENSE

p_strKeyword=Linear context-free rewriting systems
p_strCode=linearcontextfreerewritingsystems

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2