Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human–viral Infection Patterns

2016 ◽  
Vol 23 (3) ◽  
pp. 165-179 ◽  
Author(s):  
Ilan Smoly ◽  
Amir Carmel ◽  
Yonat Shemer-Avni ◽  
Esti Yeger-Lotem ◽  
Michal Ziv-Ukelson
Keyword(s):  
Viral Infection ◽  
Regular Tree ◽  
Tree Grammar ◽  
Network Search

Solving Regular Tree Grammar Based Constraints

2001 ◽  
pp. 213-233 ◽  
Author(s):  
Yanhong A. Liu ◽  
Ning Li ◽  
Scott D. Stoller
Keyword(s):  
Regular Tree ◽  
Tree Grammar

scholarly journals Normal-order reduction grammars

2017 ◽  
Vol 27 ◽  
Author(s):  
MACIEJ BENDKOWSKI
Keyword(s):  
Upper Bound ◽  
Generating Functions ◽  
Order Reduction ◽  
Combinatory Logic ◽  
Recursive Method ◽  
Normal Order ◽  
Regular Tree ◽  
Tree Grammar ◽  
Primitive Recursive

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.

Regular Approximation of Weighted Linear Context-Free Tree Languages

2017 ◽  
Vol 28 (05) ◽  
pp. 523-542
Author(s):  
Markus Teichmann
Keyword(s):  
Tree Language ◽  
Regular Tree ◽  
Tree Grammar ◽  
Regular Approximation ◽  
Leibler Divergence ◽  
Tree Languages ◽  
Free Tree ◽  
Context Free

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.

Sign in / Sign up

Export Citation Format

Share Document