On Computing the Measures of First-Order Definable Sets of Trees

by   Marcin Przybyłko, et al.

We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or by a Boolean combination of conjunctive queries (with descendant relation) is rational and computable. Additionally, we provide an example of a first-order formula that uses descendant relation and defines a language of infinite trees having an irrational measure.


page 1

page 2

page 3

page 4


Continuous Uniformization of Rational Relations and Synthesis of Computable Functions

A uniformizer of a binary relation is a function whose graph is containe...

The Regular Languages of First-Order Logic with One Alternation

The regular languages with a neutral letter expressible in first-order l...

The Extended Theory of Trees and Algebraic (Co)datatypes

The first-order theory of finite and infinite trees has been studied sin...

Languages ordered by the subword order

We consider a language together with the subword relation, the cover rel...

Non-ambiguous trees: new results and generalisation (Full version)

We present a new definition of non-ambiguous trees (NATs) as labelled bi...

Kac-Rice formula: A contemporary overview of the main results and applications

The book develops the fundamental ideas of the famous Kac-Rice formula f...

Relating Information and Proof

In mathematics information is a number that measures uncertainty (entrop...