No. |
Title |
Author |
Year |
---|

1 |
A Kleene Theorem for Nominal Automata |
Brunet, Paul et al. |
2019 |

2 |
An Algebraic Framework to Reason About Concurrency (Invited Talk) |
Silva, Alexandra |
2019 |

3 |
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk) |
Silva, Alexandra |
2019 |

4 |
Kleene Algebra with Observations |
Kappé, Tobias et al. |
2019 |

5 |
Tree Automata as Algebras: Minimisation and Determinisation |
van Heerdt, Gerco et al. |
2019 |

6 |
Almost Sure Productivity |
Aguirre, Alejandro et al. |
2018 |

7 |
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages |
Kappé, Tobias et al. |
2017 |

8 |
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk) |
Silva, Alexandra |
2017 |

9 |
CALF: Categorical Automata Learning Framework |
van Heerdt, Gerco et al. |
2017 |

10 |
The Power of Convex Algebras |
Bonchi, Filippo et al. |
2017 |

11 |
Coalgebraic Learning (Invited Talk) |
Silva, Alexandra |
2016 |

12 |
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning |
Endrullis, Jörg et al. |
2015 |

13 |
Applications of Automata and Concurrency Theory in Networks (Invited Paper) |
Silva, Alexandra |
2015 |

14 |
Generalizing the powerset construction, coalgebraically |
Silva, Alexandra et al. |
2010 |