Related papers: Unambiguous separators for tropical tree automata
Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus,…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
The problem of computing the edit-distance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recognition. This paper presents linear-space algorithms for…
Binary linear classification has been explored since the very early days of the machine learning literature. Perhaps the most classical algorithm is the Perceptron, where a weight vector used to classify examples is maintained, and additive…
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…
Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly distributed as possible) and they…
We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax the notion of accepting run by allowing a certain quantity…
Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an…
We show that several decision problems originating from max-plus or tropical convexity are equivalent to zero-sum two player game problems. In particular, we set up an equivalence between the external representation of tropical convex sets…
Nonuniform families of polynomial-size finite automata and pushdown automata respectively have strong connections to nonuniform-NL and nonuniform-LOGCFL. We examine the behaviors of unambiguous and co-nondeterministic computations produced…
This paper supplements [17], showing that categorically the layered theory is the same as the theory of ordered monoids (e.g. the max-plus algebra) used in tropical mathematics. A layered theory is developed in the context of categories,…
With the development of connected filters for the last decade, many algorithms have been proposed to compute the max-tree. Max-tree allows to compute the most advanced connected operators in a simple way. However, no fair comparison of…
We advance the recently proposed neuro-symbolic Differentiable Tree Machine, which learns tree operations using a combination of transformers and Tensor Product Representations. We investigate the architecture and propose two key…
Given a finite set $A$ and a group homomorphism $\phi : H \to G$, a $\phi$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $\phi$-equivariant in the sense that…
This article introduces the novel framework of max-algebraic hybrid automata as a hybrid modelling language in the max-plus algebra. We show that the modelling framework unifies and extends the switching max-plus linear systems framework…
A data tree is an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and an element ("datum") from an infinite set, where the latter can only be compared for equality. The article considers alternating…