Related papers: Ramsey Quantifiers over Automatic Structures: Comp…
The celebrated theorem of Kechris, Pestov and Todor\v{c}evi\'c connecting structural Ramsey theory with topological dynamics has as a consequence that the Fra\"{\i}ss\'e limit of a Ramsey class of non-trivial finite relational structures…
We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
Comparative constructions pose a challenge in Natural Language Inference (NLI), which is the task of determining whether a text entails a hypothesis. Comparatives are structurally complex in that they interact with other linguistic…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
This article is concerned with classes of relational structures that are closed under taking substructures and isomorphism, that have the joint embedding property, and that furthermore have the Ramsey property, a strong combinatorial…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of…
A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our main motivation is that their constructions, as well as…
There are many types of automata and grammar models that have been studied in the literature, and for these models, it is common to determine whether certain problems are decidable. One problem that has been difficult to answer throughout…
We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well…
This paper investigates the algorithmic safety verification problem of infinite-state parameterized concurrent programs over a rich set of communication topologies. The goal is to automatically produce a proof of correctness in the form of…
We consider Parikh images of languages accepted by non-deterministic finite automata and context-free grammars; in other words, we treat the languages in a commutative way --- we do not care about the order of letters in the accepted word,…
In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose…
This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset…
How do we measure genuine understanding in artificial cognitive systems? Current approaches face a measurement gap: probabilistic systems refine confidence gradually, practice-based systems compile knowledge through repeated execution, and…
Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of…
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…
This work presents a quantitative framework for describing the overcompleteness of a large class of frames. It introduces notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and $\mathcal{E} =…