In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
Binary and grayscale mathematical morphology have many applications in different area. On the other hand, colour morphology is not widespread. The reason is the lack of a unique o...
Schematic proofs are functions which can produce a proof of a proposition for each value of their parameters. A schematic proof can be constructed by abstracting a general pattern ...
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...