AI Chat AI Image Generator AI Video Text to Speech

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

03/12/2021

∙

by Bérénice Delcroix-Oger, et al.

∙

∙

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain q-versions of our formula. We finally generalise NATs to higher dimension.

Bérénice Delcroix-Oger
2 publications
Florent Hivert
1 publication
Patxi Laborde-Zubieta
2 publications
Jean-Christophe Aval
1 publication
Adrien Boussicault
1 publication

page 1

page 2

page 3

page 4

research

∙ 04/19/2018

Entropy rates for Horton self-similar trees

In this paper we examine planted binary plane trees. First, we provide a...

0 Evgenia V. Chunikhina, et al. ∙

research

∙ 09/07/2020

Ambiguity Hierarchy of Regular Infinite Tree Languages

An automaton is unambiguous if for every input it has at most one accept...

0 Alexander Rabinovich, et al. ∙

research

∙ 05/27/2018

Palindromes in starlike trees

In this note, we obtain an upper bound on the maximum number of distinct...

0 Amy Glen, et al. ∙

research

∙ 09/10/2018

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

We consider the problem of computing the measure of a regular language o...

0 Marcin Przybyłko, et al. ∙

research

∙ 04/02/2019

A rearrangement distance for fully-labelled trees

The problem of comparing trees representing the evolutionary histories o...

0 Giulia Bernardini, et al. ∙

research

∙ 04/29/2018

Trees in partial Higher Dimensional Automata

In this paper, we give a new definition of partial Higher Dimension Auto...

0 Jérémy Dubut, et al. ∙

research

∙ 08/30/2022

Unbalancing Binary Trees

Assuming Zipf's Law to be accurate, we show that existing techniques for...

0 Matthew L. Ginsberg, et al. ∙