Related papers: Language Classes Associated With Automata Over Mat…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
A regular language $L$ is said to be prime, if it is not the product of two non-trivial languages. Martens et al. settled the exact complexity of deciding primality for deterministic finite automata in 2010. For finite languages, Mateescu…
An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
During the last decades, classical models in language theory have been extended by control mechanisms defined by monoids. We study which monoids cause the extensions of context-free grammars, finite automata, or finite state transducers to…
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that…
We prove that the 2-hermitean matrix model and the complex-matrix model obey the same loop equations, and as a byproduct, we find a formula for Itzykzon-Zuber's type integrals over the unitary group. Integrals over U(n) are rewritten as…
A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
Given a special biserial algebra $\Lambda$ over an algebraically closed field, let $\mathrm{rad}_\Lambda$ denote the radical of its module category. The authors showed with Sinha that the stable rank of a special biserial algebra $\Lambda$,…
We revisit the membership problem for subclasses of rational relations over finite and infinite words: Given a relation R in a class C_2, does R belong to a smaller class C_1? The subclasses of rational relations that we consider are formed…
We give formulae relating the value of an irreducible character of a classical group at a matrix to entries of powers of the matrix. This yields a far-reaching generalization of a result of J. L. Cisneros-Molina concerning the $GL_2$ case.
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In…
This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.
We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove…