Totally ordered measured trees and splitting trees with infinite variation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logics and Automata for Totally Ordered Trees

A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we stu...

متن کامل

Splitting trees

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simultaneously splitting each of its non-trivial trees. The splitting number a(T) of a tree T is the minimum number of successive forest splittings which lead to deletion of all of T’s edges. An O(N) algorithm is proposed to get an upper bound c...

متن کامل

Projectivity in Totally Ordered Rooted Trees: An Alternative Definition of Projectivity and Optimal Algorithms for Detecting Non-Projective Edges and Projectivizing Totally Ordered Rooted Trees

This paper discusses the notion of projectivity and algorithms for projectivizing and detecting non-projective edges in totally ordered rooted trees (such trees are used in dependency syntax analysis of natural language, where they are called dependency trees). In the first part, we review the notion of projectivity, then we present a new definition inspired by the algorithmic inquiry and show ...

متن کامل

Splitting trees at vertices

We present tight bounds on splitting trees into “small” subtrees.

متن کامل

PDL for Ordered Trees

This paper is about a special version of PDL, designed by Marcus Kracht for reasoning about sibling ordered trees. It has four basic programs corresponding to the child, parent, leftand right-sibling relations in such trees. The original motivation for this language is rooted in the field of model-theoretic syntax. Motivated by recent developments in the area of semistructured data, and, especi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2018

ISSN: 1083-6489

DOI: 10.1214/18-ejp251