In the late 1960s and early 1970s, the concepts of graph transformation and graph
grammars started to become of interest in picture processing and computer science. The …

We introduce adhesive categories, which are categories with structure ensuring that
pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories …

This paper describes the use of statistical techniques and hidden Markov models (HMM) in
the recognition of emotions. The method aims to classify 6 basic emotions (anger, dislike …

String diagrams are a powerful and intuitive graphical syntax, originating in theoretical
physics and later formalised in the context of symmetric monoidal categories. In recent …

Writing in a second language is a complex activity requiring proficiency in a number of
different areas. l Writing programmes often focus on particular areas of skill and knowledge …

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric
monoidal categories (SMCs). They find many applications in computer science and are …

Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them
suitable to express resource-sensitive systems, in which variables cannot be copied or …

Adhesive high-level replacement (HLR) categories and systems are introduced as a new
categorical framework for graph transformation in a broad sense, which combines the well …

We study a framework for the specification of architecture styles as families of architectures
involving a common set of types of components and coordination mechanisms. The …

The theory of reactive systems, introduced by Leifer and Milner and previously extended by
the authors, allows the derivation of well-behaved labelled transition systems (LTS) for …