Related papers: Model Theoretic Complexity of Automatic Structures
It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…
Similar to topological spaces, we introduce the Cantor-Bendixson rank of a tree $T$ by repeatedly removing the leaves and the isolated vertices of $T$ using transfinite recursion. Then, we give a representation of a tree $T$ as a leafless…
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…
We introduce a new class of automata (which we coin EU-automata) running on infininte trees of arbitrary (finite) arity. We develop and study several algorithms to perform classical operations (union, intersection, complement, projection,…
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…
I discuss a family of statistical-mechanics models in which (some classes of) elements of a finite group $G$ occupy the (directed) edges of a lattice; the product around any plaquette is constrained to be the group identity $e$. Such a…
Courcelle's Theorem states that every problem definable in Monadic Second-Order logic can be solved in linear time on structures of bounded treewidth, for example, by constructing a tree automaton that recognizes or rejects a tree…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…
We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…
Downarowicz and Maass (2008) proposed topological ranks for all homeomorphic Cantor minimal dynamical systems using properly ordered Bratteli diagrams. In this study, we adopt this definition to the case of all essentially minimal…
While extracting information from data with machine learning plays an increasingly important role, physical laws and other first principles continue to provide critical insights about systems and processes of interest in science and…
We take two approaches to classifying the complexity of Presburger models: Scott analysis and degree spectra. In particular, we investigate the possible Scott sentence complexities and possible degree spectra of models of Presburger…
We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…