Related papers: (k,l)-Unambiguity and Quasi-Deterministic Structur…
We present and prove a theorem answering the question "how many states does a minimal deterministic finite automaton (DFA) that recognizes the set of base-b numbers divisible by k have?"
We study symplectic structures on characteristically nilpotent Lie algebras (CNLAs) by computing the cohomology space $H^2(\Lg,k)$ for certain Lie algebras $\Lg$. Among these Lie algebras are filiform CNLAs of dimension $n\le 14$. It turns…
The automorphisms of free groups with boundaries form a family of groups A_{n,k} closely related to mapping class groups, with the standard automorphisms of free groups as A_{n,0} and (essentially) the symmetric automorphisms of free groups…
Let G be the unramified unitary group in three variables defined over a p-adic field F of odd residual characteristic. In this paper, we investigate local newforms for irreducible admissible representations of G. We introduce a family of…
The Lie product and the order relation are viewed as defining structures for Hamiltonian dynamical systems. Their admissible combinations are singled out by the requirement that the group of the Lie automorphisms be contained in the group…
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…
In this paper, we find a family $SL^{n,m}$, in any arbitrary dimensions, of cohomologically rigid solvable Lie superalgebras with nilradical the model filiform Lie superalgebra $L^{n,m}$. Moreover, we exhibit a family of cohomologically…
We analyze $\mathrm{C}^\ast$-algebras, particularly AF-algebras, and their $K_0$-groups in the context of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$. Given two separable unital AF-algebras $A$ and $B$, and considering their…
In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite…
The work presents some new algorithms realized recently in the package TESTAS. They decide whether or not deterministic finite automaton (DFA) is synchronizing, several procedures find relatively short synchronizing words and a…
We show that, in the framework of covariant Hamiltonian field theory, a degenerate almost regular quadratic Lagrangian $L$ admits a complete set of non-degenerate Hamiltonian forms such that solutions of the corresponding Hamilton…
Compact representations of automata are important for efficiency. In this paper, we study methods to compute reduced automata, in which no two states accept the same language. We do this for finitary automata (FA), an abstract definition…
We construct left invariant special K\"ahler structures on the cotangent bundle of a flat pseudo-Riemannian Lie group. We introduce the twisted cartesian product of two special K\"ahler Lie algebras according to two linear representations…
Given a finite-dimensional complex Lie algebra g equipped with a nondegenerate, symmetric, invariant bilinear form B, let V_k(g,B) denote the universal affine vertex algebra associated to g and B at level k. For any reductive group G of…
It is proved that the assembly maps in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups with finite asymptotic dimension that admit a finite model for the classifying space for proper actions.…
Bivariant (equivariant) K-theory is the standard setting for non-commutative topology. We may carry over various techniques from homotopy theory and homological algebra to this setting. Here we do this for some basic notions from…
Let L contain only the equality symbol and let L^+ be an arbitrary finite symmetric relational language containing L . Suppose probabilities are defined on finite L^+ structures with ''edge probability'' n^{- alpha}. By T^alpha, the almost…
We study automorphisms and representations of quasi polynomial algebras (QPAs) and quasi Laurent polynomial algebras (QLPAs). For any QLPA defined by an arbitrary skew symmetric integral matrix, we explicitly describe its automorphism…
Multi-letter {\it quantum finite automata} (QFAs) were a new one-way QFA model proposed recently by Belovs, Rosmanis, and Smotrovs (LNCS, Vol. 4588, Springer, Berlin, 2007, pp. 60-71), and they showed that multi-letter QFAs can accept with…
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous…