Related papers: Kunz languages for numerical semigroups are contex…
Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We…
Domain theory has its origins in Mathematics and Theoretical Computer Science. Mathematically it combines order and topology. Its central concepts have their origin in the idea of approximating ideal objects by their relatively finite or,…
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…
We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…
$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…
This is a survey of our construction of current algebras, associated with complex curves and rational differentials. We also study in detail two classes of examples. The first is the case of a rational curve with differentials $z^n dz$;…
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…
Let $S$ be a subsemigroup of a second countable locally compact group $G$, such that $S^{-1}S=G$. We consider the $C^*$-algebra $C^*_\delta(S)$ generated by the operators of translation by all elements of $S$ in $L^2(S)$. We show that this…
Given two coprime numbers $p<q$, KW semigroups contain $p,q$ and are contained in $\langle p,q,r \rangle$ where $2r= p,q, p+q$ whichever is even. These semigroups were first introduced by Kunz and Waldi. Kunz and Waldi proved that all $KW$…
We introduce a new invariant for C*-algebras of stable rank one that merges the Cuntz semigroup information together with the K$_1$-group information. This semigroup, termed the Cu$_1$-semigroup, is constructed as equivalence classes of…
For a C$^*$-algebra $A$, it is an important problem to determine the Cuntz semigroup $\mathrm{Cu}(A\otimes\mathcal{Z})$ in terms of $\mathrm{Cu}(A)$. We approach this problem from the point of view of semigroup tensor products in the…
We calculate the Cuntz semigroup of the tensor product A with A. We restrict our attention to C*-algebras A which are unital, simple, nuclear, stably finite, have stable rank one, absorbs the Jiang-Su algebra tensorially and satisfy the…
We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a…
A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they…
GF(2)-grammars are a recently introduced grammar family with some unusual algebraic properties. They are closely connected to unambiguous grammars. By using the method of formal power series, we establish strong conditions that are…
In this article we survey some of the recent goings-on in the classification programme of C$^*$-algebras, following the interesting link found between the Cuntz semigroup and the classical Elliott invariant and the fact that the Elliott…
We prove that a group has word problem that is a growing context-sensitive language precisely if its word problem can be solved using a non-deterministic Cannon's algorithm (the deterministic algorithms being defined by Goodman and…
We develop a theory of general quotients for W- and Cu-semigroups beyond the case of quotients by ideals. To this end, we introduce the notion of a normal pair, which allows us to take quotients of W-semigroups in a similar way as normal…