相关论文: Classification of groups generated by 3-state auto…

This is a paper in Analytic Topology.

We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFAs) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its…

We examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines.…

We perform a complete classification of all 56 subgroups of the two-qubit Clifford group containing the two-qubit Pauli group. We provide generators for these groups using gates familiar to the quantum information community and we reference…

Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…

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 us consider a polynomial algebra in three variables equipped with an integer grading. We construct a system of group-generating automorphisms that preserve a given grading.

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

We determine the structure of automorphism group or each nonsplit metacyclic 2-group. This completes the work on automorphism groups of metacyclic $p$-groups.

This paper gives a concise introduction into the basic theory of {\omega}-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating…

We investigate the group gradings on the algebra of upper triangular matrices over an arbitrary field, viewed as a Lie algebra. These results were obtained a few years early by the same authors. We provide streamlined proofs, and present a…

We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

In this paper we address the problem of constructing a class of representations of Clifford algebras that can be named "alphabetic (re)presentations". The Clifford algebras generators are expressed as m-letter words written with a…

In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata…

In this paper we consider the set ${\mathbb Z}^{\pm\omega}_{6}$ of two-way infinite words $\xi$ over the alphabet $\{0,1,2,3,4,5\}$ with the integer left part $\lfloor\xi\rfloor$ and the fractional right part $\{\xi\}$ separated by a radix…

We compute the integral cohomology rings of a family of 3-groups. As a corollary, we exhibit, for each n greater than or equal to 5, a pair of groups of order 3^n whose integral cohomology rings are isomorphic.