A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...