Related papers: Restrictions on Potential Automatic Structures on …
By the density of a finite graph we mean its average vertex degree. For an $m$-generated group, the density of its Cayley graph in a given set of generators, is the supremum of densities taken over all its finite subgraphs. It is known that…
We give strengthened versions of the Herwig-Lascar and Hodkinson-Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous…
For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be expressed as a finite union of languages A*aA*bA*...A*cA*, where a,b,...,c are letters. The class L(1) is…
We show that for a large class $\mathcal{C}$ of finitely generated groups of orientation preserving homeomorphisms of the real line, the following holds: Given a group $G$ of rank $k$ in $\mathcal{C}$, there is a sequence of $k$-markings…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
Students find their first course in Formal Languages and Automata Theory challenging. In addition to the development of formal arguments, most students struggle to understand nondeterministic computation models. In part, the struggle stems…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
The automorphism groups of several of Thompson's countable groups of piecewise linear homeomorphisms of the line and circle are computed and it is shown that the outer automorphism groups of these groups are relatively small. These results…
Distributional learning provides a framework for studying the learnability of structured languages from positive data. In this paper, we extend this framework to graph languages generated by fixed-interface clause systems. We formulate…
Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we…
An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean…
Let $L(G)$ denote the space of integer-valued length functions on a countable group $G$ endowed with the topology of pointwise convergence. Assuming that $G$ does not satisfy any non-trivial mixed identity, we prove that a generic (in the…
We present a necessary condition for an infinite language to be multiple context-free, which we call a Substitution Lemma. We apply it to show a sample selection of languages are not multiple context-free, including the word problem of the…
For a group $G$ of not prime power order, Oliver showed that the obstruction for a finite CW-complex $F$ to be the fixed point set of a contractible finite $G$-CW-complex is the Euler characteristic $\chi(F)$. He also has the similar…
We introduce a theory of "patterns" in order to study geodesics in a certain class of group presentations. Using patterns we show that there does not exist a geodesic automatic structure for certain group presentations, and that certain…
Zero-resource word segmentation and clustering systems aim to tokenise speech into word-like units without access to text labels. Despite progress, the induced lexicons are still far from perfect. In an idealised setting with gold word…
We give examples of finitely presented groups containing elements with irrational (in fact, transcendental) stable commutator length, thus answering in the negative a question of M. Gromov. Our examples come from 1-dimensional dynamics, and…
It is shown that finite-index extensions and finite-index subgroups of $\omega$-stable groups can be model-theoretically wild. More precisely, there exists an $\omega$-stable group $G$ such that any given countable first-order structure in…
Recent work in NLP shows that LSTM language models capture compositional structure in language data. For a closer look at how these representations are composed hierarchically, we present a novel measure of interdependence between word…