scholarly journals Monadic Datalog and Regular Tree Pattern Queries

2016 ◽  
Vol 41 (3) ◽  
pp. 1-43
Author(s):  
Filip Mazowiecki ◽  
Filip Murlak ◽  
Adam Witkowski
Keyword(s):  
Regular Tree ◽  
Tree Pattern

scholarly journals Tree pattern matching from regular tree expressions

Kybernetika ◽  
2018 ◽  
pp. 221-242
Author(s):  
Ahlem Belabbaci ◽  
Hadda Cherroun ◽  
Loek Cleophas ◽  
Djelloul Ziadi
Keyword(s):  
Pattern Matching ◽  
Regular Tree ◽  
Tree Pattern ◽  
Tree Pattern Matching

scholarly journals A new algorithm for linear regular tree pattern matching

2000 ◽  
Vol 242 (1-2) ◽  
pp. 125-142 ◽  
Author(s):  
Priti Shankar ◽  
Amitranjan Gantait ◽  
A.R. Yuvaraj ◽  
Maya Madhavan
Keyword(s):  
Pattern Matching ◽  
Regular Tree ◽  
Tree Pattern ◽  
Tree Pattern Matching

Property Testing of Regular Tree Languages

Algorithmica ◽  
2007 ◽  
Vol 49 (2) ◽  
pp. 127-146 ◽  
Author(s):  
Frédéric Magniez ◽  
Michel de Rougemont
Keyword(s):  
Property Testing ◽  
Regular Tree ◽  
Tree Languages

scholarly journals Contact process on regular tree with random vertex weights

2017 ◽  
Vol 12 (5) ◽  
pp. 1163-1181
Author(s):  
Yu Pan ◽  
Dayue Chen ◽  
Xiaofeng Xue
Keyword(s):  
Contact Process ◽  
Regular Tree

PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS

2010 ◽  
Vol 21 (03) ◽  
pp. 257-276 ◽  
Author(s):  
ANDREAS MALETTI ◽  
CĂTĂLIN IONUŢ TÎRNĂUCĂ
Keyword(s):  
Cartesian Product ◽  
Canonical Representation ◽  
Finite Union ◽  
Top Down ◽  
Tree Language ◽  
Regular Tree ◽  
Fundamental Properties ◽  
Tree Transducers ◽  
Tree Languages ◽  
Context Free

The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is defined by a tree bimorphism (φ, L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under finite union. However, QUASI is not closed under intersection and complement. In addition, many standard relations on trees (e.g., branches, subtrees, v-product, v-quotient, and f-top-catenation) are not quasi-relabeling relations. If quasi-relabeling relations are considered as string relations (by taking the yields of the trees), then every Cartesian product of two context-free string languages is a quasi-relabeling relation. Finally, the connections between quasi-relabeling relations, alphabetic relations, and classes of tree relations defined by several types of top-down tree transducers are presented. These connections yield that quasi-relabeling relations preserve the regular and algebraic tree languages.

Sign in / Sign up

Export Citation Format

Share Document