The powerset construction is a standard method for converting a nondeterministic automaton into an equivalent deterministic one as far as language is concerned. In this talk, we lift the powerset construction on automata to the more general framework of coalgebras with structured state spaces. Examples of applications include partial Mealy …
read moreOther presentations
Tool demonstration
Software Tools Demonstration
A number of our colleague in SEN3 have been developing software tools in the context of their various projects. Many, but not all, of these tools are related to Reo and are integrated into the Eclipse Coordination Tools (ECT). The ECT also incorporates some tools developed by …
read moreA Kleene theorem for polynomial coalgebras
For polynomial functors G, we show how to generalize the classical notion of regular expression to G-coalgebras. We introduce a language of expressions for describing elements of the final G-coalgebra and, analogously to Kleeneâs theorem, we show the correspondence between expressions and finite G-coalgebras.
read moreBehavioural differential equations and coinduction for binary trees
A binary tree T can be encoded as a function from the set of words over the alphabet {0,1} to a set K (corresponding to the information stored in the nodes). If this set K has a semiring structure then T is a formal power series. Following previous work …
read moreInnovation in the Practice of Computer Science Education to follow Bologna
The "adoption of a system of easily readable and comparable degrees" stated in the Bologna declaration, requires, from higher education institutions, a move towards innovative student-centred approaches which align course units planning, teaching and assessment. This presentation, by a member of the staff team -- the students tutor, reports and reviews …
read more
Page 1 / 1