Related papers: Classification of groups generated by 3-state auto…
Holt and R\"over proved that finitely generated bounded automata groups have indexed co-word problem. Here we sharpen this result to show they are in fact co-ET0L.
The state complexity of a Deterministic Finite-state automaton (DFA) is the number of states in its minimal equivalent DFA. We study the state complexity of random $n$-state DFAs over a $k$-symbol alphabet, drawn uniformly from the set…
We present an efficient method for computing the ${\rm SL}(3,\mathbb{C})$-character varieties of two-generator groups.
We give several characterisations of groupoids determined by involutive automorphisms on semilattices of groups.
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…
Both topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly…
We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…
We show that for any unambiguous finite automaton with $n$ states there exists an unambiguous finite automaton with $\sqrt{n+1} \cdot 2^{n/2}$ states that recognizes the complement language. This builds and improves upon a similar result by…
In this paper we present some experiments to automatically classify online handwritten text based on capital letters. Although handwritten text is not as discriminative as face or voice, we still found some chance for gender classification…
Given an almost simple group $A$, we algorithmically show that the character table of $A$ determines whether or not the Sylow 3-subgroups of $A$ are 2-generated. We show this property is equivalent to a condition involving the Galois action…
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…
We clarify the structure of subgroups generated by conjugate graph automorphisms of order $3$ of $O_8^+(2)$ and $O_8^+(3)$. As a result, we obtain a correction to a paper by S. Guest which, in turn, plays an important role in proving the…
We construct a 4-state 2-letter bireversible automaton generating the lamplighter group $(\mathbb Z_2^2)\wr\mathbb Z$ of rank two. The action of the generators on the boundary of the tree can be induced by the affine transformations on the…
Finite automata were used to determine multiple addresses in number systems and to find topological properties of self-affine tiles and finite type fractals. We join these two lines of research by axiomatically defining automata which…
This paper (cmp-lg/yymmnnn) has been accepted for publication in the student session of EACL-95. It outlines ongoing work using statistical and unsupervised neural network methods for clustering words in untagged corpora. Such approaches…
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…
Local grammars can be represented in a very convenient way by automata. This paper describes and illustrates an efficient algorithm for the application of local grammars put in this form to lemmatized texts.