Related papers: Dualizability of automatic algebras

This paper is devoted to the description of complex finite-dimensional algebras of level two. We obtain the classification of algebras of level two in the variety of Leibniz algebras. It is shown that, up to isomorphism, there exist three…

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…

We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…

In the field of computational logic, two classes of finite automata are considered fundamental: deterministic and nondeterministic automata (DFAs and NFAs). In a more fine-grained approach three natural intermediate classes were introduced,…

A finite-dimensional Lie algebra is called an A-algebra if all of its nilpotent subalgebras are abelian. These arise in the study of constant Yang-Mills potentials and have also been particularly important in relation to the problem of…

Let A be a unitary algebra and G be a finite abelian group. Then a G-graded algebra is merely a G-algebra and viceversa because of the fact that G and its group of characters G* are isomorphic. This fact is no longer true if we substitute G…

J. G. Thompson showed that a finite group G is solvable if and only if every two -generated subgroup is solvable. Recently, Grunevald, Kunyavskii, Nikolova, and Plotkin have shown that the analogue holds for finite-dimensional Lie algebras…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. It was conjectured that in each completely…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…

Let $A$ be a finite-dimensional commutative associative algebra with unity over an algebraically closed field $\mathbb{K}$. The purpose of the paper is to study the solvability of $G_A$, where $G_A$ is the identity component of…

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

We suggest an approach for description of integrable cases of the Abel equations. It is based on increasing of the order of equations up to the second one and using equivalence transformations for the corresponding second-order ordinary…

We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…