intTypePromotion=1
ADSENSE

Unordered context-free grammars

Xem 1-1 trên 1 kết quả Unordered context-free grammars
  • We prove in this paper that unordered, or I D / L P grammars, are e.xponentially more succinct than contextfree grammars, by exhibiting a sequence (L,~) of finite languages such that the size of any CFG for L,~ must grow exponentially in n, but which can be described by polynomial-size I D / L P grammars. The results have implications for the description of free word order languages.

    pdf5p bungio_1 03-05-2013 32 1   Download

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

ADSENSE

p_strKeyword=Unordered context-free grammars
p_strCode=unorderedcontextfreegrammars

nocache searchPhinxDoc

 

Đồng bộ tài khoản