Related papers: (k,l)-Unambiguity and Quasi-Deterministic Structur…
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
The classification of complex of real finite dimensional Lie algebras which are not semi simple is still in its early stages. For example the nilpotent Lie algebras are classified only up to the dimension 7. Moreover, to recognize a given…
We construct a new family of affine $W$-algebras $W^k(\lambda,\mu)$ parameterized by partitions $\lambda$ and $\mu$ associated with the centralizers of nilpotent elements in $\mathfrak{gl}_N$. The new family unifies a few known classes of…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
Let $NFA_b(q)$ denote the set of languages accepted by nondeterministic finite automata with $q$ states over an alphabet with $b$ letters. Let $B_n$ denote the set of words of length $n$. We give a quadratic lower bound on the VC dimension…
In this article, we study flag-transitive automorphism groups of non-trivial symmetric $(v, k, \lambda)$ designs, where $\lambda$ divides $k$ and $k\geq \lambda^2$. We show that such an automorphism group is either point-primitive of affine…
We construct uncountably many mutually nonisomorphic simple separable stably finite unital exact C$^\ast$-algebras which are not isomorphic to their opposite algebras. In particular, we prove that there are uncountably many possibilities…
Quasi *-algebras possessing a sufficient family $\mathcal{M}$ of invariant positive sesquilinear forms carry several topologies related to $\mathcal{M}$ which make every *-representation continuous. This leads to define the class of locally…
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ…
We investigate the filtration corresponding to the degree function induced by a non-zero locally nilpotent derivation and its associated graded algebra. We show that this kind of filtration, referred to as the LND-filtration, is the ideal…
We establish isomorphism ranges for the comparison maps between algebraic and topological K-groups, extending classical Quillen-Lichtenbaum conjecture to separated complex schemes of finite type after refinement. Additionally, we…
The identification of a deterministic finite automaton (DFA) from labeled examples is a well-studied problem in the literature; however, prior work focuses on the identification of monolithic DFAs. Although monolithic DFAs provide accurate…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
If $f$ is an automorphism of a compact simply connected K\"ahler manifold with trivial canonical bundle that fixes a K\"ahler class, then the order of $f$ is finite. We apply this well known result to construct compact non-K\"ahler…
Let $\text{Ham(M,L)}$ denote the group of Hamiltonian diffeomorphisms on a symplectic manifold $M$, leaving a Lagrangian submanifold $L\subset M$ invariant. In this paper, we show that $\text{Ham(M,L)}$ has the fragmentation property, using…
We provide families of compact $(n + 1)$-dimensional complex non K\"ahler manifolds satisfying the $\partial\bar{\partial}$-Lemma, with holomoprhically trivial canonical bundle, carrying a balanced metric and with no $p$-K\"ahler…
In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…
Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach to generate NFA from an interaction language such as UML…
Grammatical inference consists in learning a formal grammar as a finite state machine or as a set of rewrite rules. In this paper, we are concerned with inferring Nondeterministic Finite Automata (NFA) that must accept some words, and…
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…