Related papers: Regular Behaviours with Names
Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…
A functor of sets $\mathbb X$ over the category of $K$-commutative algebras is said to be an affine functor if its functor of functions, $\mathbb A_{\mathbb X}$, is reflexive and $\mathbb X=\Spec \mathbb A_{\mathbb X}$. We prove that affine…
If $G$ is a finite $\ell$-group acting on an affine space $\mathbb{A}^n$ over a finite field $K$ of cardinality prime to $\ell$, Serre has shown that there exists a rational fixed point. We generalize this to the case where $K$ is a…
Esik and Maletti introduced the notion of a proper semiring and proved that some important (classes of) semirings -- Noetherian semirings, natural numbers -- are proper. Properness matters as the equivalence problem for weighted automata…
For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
It is common to model inductive datatypes as least fixed points of functors. We show that within the Cedille type theory we can relax functoriality constraints and generically derive an induction principle for Mendler-style lambda-encoded…
We discuss some results concerning fixed point equations in the setting of topological *-algebras of unbounded operators. In particular, an existence result is obtained for what we have called {\em weak $\tau$ strict contractions}, and some…
The main theorem provides a characterisation of the finite rank operators lying in a norm closed Lie ideal of a continuous nest algebra. These operators are charaterised as those finite rank operators in the nest algebra satisfying a…
The finite condensation $\sim_F$ is an equivalence relation defined on a linear order $L$ by $x \sim_F y$ if and only if the set of points lying between $x$ and $y$ is finite. We define an operation $\cdot_F$ on linear orders $L$ and $M$ by…
If C and D are varieties of algebras in the sense of general algebra, then by a representable functor C --> D we understand a functor which, when composed with the forgetful functor D --> Set, gives a representable functor in the classical…
We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques -- as those popular in process calculi -- we extend classical regular expressions with names (to model…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…
We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are…
We study the quantizations of the algebras of regular functions on nilpotent orbits. We show that such a quantization always exists and is unique if the orbit is birationally rigid. Further we show that, for special birationally rigid…
We consider a fixed free and proper action of a locally compact group $G$ on a space $T$, and actions $\alpha:G\to \Aut A$ on $C^*$-algebras for which there is an equivariant embedding of $(C_0(T),\rt)$ in $(M(A),\alpha)$. A recent theorem…
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…
We study rational modules over complete path and monomial algebras, and the problem of when rational modules over the dual $C^*$ of a coalgebra $C$ are closed under extensions, equivalently, when is the functor $Rat$ a torsion functor. We…
To, say, a proper algebraic or holomorphic space $X/S$, and a coherent sheaf ${\mathcal F}$ on $X$ we identify a functorial ideal, the fitted flatifier, blowing up sequentially in which leads to a flattening of the proper transform of…