Activities per year
We provide a unified and elementary proof of both properties. In contrast with earlier completeness proofs, this proof does not rely on minimality or bisimilarity techniques for deterministic automata. Instead, our approach avoids deterministic automata altogether, and uses Antimirov’s derivatives and the well-known transition monoid construction.
Our results are fully verified in the Coq proof assistant.
|Title of host publication||Relational and Algebraic Methods in Computer Science|
|Editors||Roland Glück, Luigi Santocanale, Michael Winter|
|Number of pages||18|
|Publication status||Published - 2023|
|Event||20th International Conference on Relational and Algebraic Methods in Computer Science - Augsburg, Germany|
Duration: 3 Apr 2023 → 6 Apr 2023
Conference number: 20
|Series||Lecture Notes in Computer Science book series|
|Conference||20th International Conference on Relational and Algebraic Methods in Computer Science|
|Abbreviated title||RAMiCS 2023|
|Period||3/04/23 → 6/04/23|
FingerprintDive into the research topics of 'Completeness and the Finite Model Property for Kleene Algebra, Reconsidered'. Together they form a unique fingerprint.
Tobias KappÃ© (Speaker)4 Apr 2023
Activity: Talk or presentation types › Conference contribution (without a publication) › Academic
Tobias KappÃ© (Participant / Attendee)3 Apr 2023 → 6 Apr 2023
Activity: Attending or organising an event types › Attending an event › Academic
Tobias KappÃ© (Speaker)28 Mar 2023
Activity: Talk or presentation types › Talk or presentation (not at a conference) › Academic
- 1 Software
Kappé, T. W. J., 21 Dec 2022
Research output: Non-textual form › Software › AcademicOpen Access