Related papers: Canonical forms for free {\kappa}-semigroups
Let H be a pseudovariety of groups in which the kappa-word problem is decidable. Here, kappa denotes the canonical implicit signature, which consists of the multiplication and the (omega-1)-power. We prove that the kappa-word problem is…
In this paper we study the $\kappa$-word problem for the pseudovariety ${\bf LG}$ of local groups, where $\kappa$ is the canonical signature consisting of the multiplication and the pseudoinversion. We solve this problem by transforming…
This paper revisits the solution of the word problem for $\omega$-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond's algorithm, based on normal forms for such…
In this paper we exhibit a type of semigroup presentations which determines a class of local groups. We show that the finite elements of this class generate the pseudovariety ${\bf LG}$ of all finite local groups and use them as…
We denote by kappa the implicit signature that contains the multiplication and the (omega-1)-power. It is proved that for any completely kappa-reducible pseudovariety of groups H, the pseudovariety DRH of all finite semigroups whose regular…
This paper deals with the reducibility property of semidirect products of the form $\bf V*\bf D$ relatively to graph equation systems, where $\bf D$ denotes the pseudovariety of definite semigroups. We show that, if the pseudovariety $\bf…
Canonical matrices are given for (a) bilinear forms over an algebraically closed or real closed field; (b) sesquilinear forms over an algebraically closed field and over real quaternions with any nonidentity involution; and (c) sesquilinear…
Beyond the crucial role they play in the foundations of the theory of overconvergent modular forms, canonical subgroups have found new applications to analytic continuation of overconvergent modular forms. For such applications, it is…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
Let $\C$ be a sequence of multisets of subspaces of a vector space $\F_q^k$. We describe a practical algorithm which computes a canonical form and the stabilizer of $\C$ under the group action of the general semilinear group. It allows us…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
Three elementary canonical transformations are shown both to have quantum implementations as finite transformations and to generate, classically and infinitesimally, the full canonical algebra. A general canonical transformation can, in…
The paper deals with $\Sigma-$composition and $\Sigma$-essential composition of terms, which lead to stable and s-stable varieties of algebras. A full description of all stable varieties of semigroups, commutative and idempotent groupoids…
We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…
Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent,…
We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of omega-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is…
In this paper many classes of sets of matrices with entries in F (F=R, F=C, F=H) are introduced. Each class with the corresponding topology determines a real analytical, complex or symplectic manifold for F=R, F=C or F=H respectively. Any…
Let $\Gamma$ be a finitely generated torsion free nilpotent group, and let $A^\omega$ be the space of infinite words over a finite alphabet $A$. We investigate two types of self-similar actions of $\Gamma$ on $A^\omega$, namely the…