tree grammar
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

2017 ◽  
Vol 28 (05) ◽  
pp. 523-542
Author(s):  
Markus Teichmann

We show how to train a weighted regular tree grammar such that it best approximates a weighted linear context-free tree grammar concerning the Kullback–Leibler divergence between both grammars. Furthermore, we construct a regular tree grammar that approximates the tree language induced by a context-free tree grammar.


Author(s):  
Christoph Jaschke ◽  
Ulla Herter ◽  
Claudia Wolkober ◽  
Carsten Schmitt ◽  
Christian Zoellin
Keyword(s):  

Author(s):  
MACIEJ BENDKOWSKI

AbstractWe present an algorithm which, for given n, generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set {S, K} of primitive combinators, requiring exactly n normal-order reduction steps to normalize. As a consequence of Curry and Feys's standardization theorem, our reduction grammars form a complete syntactic characterization of normalizing combinatory logic terms. Using them, we provide a recursive method of constructing ordinary generating functions counting the number of SK-combinators reducing in n normal-order reduction steps. Finally, we investigate the size of generated grammars giving a primitive recursive upper bound.


2016 ◽  
Vol 251 ◽  
pp. 215-251 ◽  
Author(s):  
Artur Jeż ◽  
Markus Lohrey
Keyword(s):  

2016 ◽  
Vol 23 (3) ◽  
pp. 165-179 ◽  
Author(s):  
Ilan Smoly ◽  
Amir Carmel ◽  
Yonat Shemer-Avni ◽  
Esti Yeger-Lotem ◽  
Michal Ziv-Ukelson

Author(s):  
Liang Ding ◽  
Abdul Samad ◽  
Xingran Xue ◽  
Xiuzhen Huang ◽  
Russell L. Malmberg ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document