Related papers: Tree Automata
We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees. We consider the case of specifications that are deterministic top-down tree automatic,…
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…
This is a short survey article written for the Erd\H{o}s centennial conference in Budapest in 2013. The main two topics covered are Szemer\'edi's theorem and its ramifications, and the Erd\H{o}s discrepancy problem. There is an emphasis on…
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity,…
In this paper we review some of the fundamental properties of the free group and give a detailed account of Stallings's theory of automata, a geometric interpretation of its subgroups that has been (and still is) immensely fruitful, both as…
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…
This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weights when growing or pruning a decision tree, allowing…
We present an unusual algorithm involving classification trees where two trees are grown in opposite directions so that they are matched at their leaves. This approach finds application in a new data mining task we formulate, called…
This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to…
This book covers static and dynamic traffic assignment models used in transportation planning and network analysis. Traffic assignment is the final step in the traditional planning process, and recent decades have seen many advances in…
This is a draft version of Part II of a three-part textbook on quantum field theory.
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable.…
Data analysis and machine learning have become an integrative part of the modern scientific methodology, offering automated procedures for the prediction of a phenomenon based on past observations, unraveling underlying patterns in data and…
The need for interpreting machine learning models is addressed through prototype explanations within the context of tree ensembles. An algorithm named Adaptive Prototype Explanations of Tree Ensembles (A-PETE) is proposed to automatise the…
Automata acceptance can, in several situations of interest, be captured game-theoretically via acceptance games. The existence of a winning strategy for Verifier then captures the existence of a winning run-tree of a given automaton over a…
We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
This paper addresses the problem of finding a representation of a subtree distance, which is an extension of the tree metric. We show that a minimal representation is uniquely determined by a given subtree distance, and give a linear time…