Checking NFA equivalence with bisimulations up to congruence
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | Principle of Programming Languages (POPL) |
| Author | Bonchi, Filippo, Pous, Damien |
| Maintainer | CCSD |
| Last Updated | November 5, 2026, 04:59 (UTC) |
| Created | November 5, 2026, 04:59 (UTC) |
| Identifier | hal-00639716 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Laboratoire de l'Informatique du Parallélisme (LIP) ; École normale supérieure de Lyon (ENS de Lyon) ; Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL) ; Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS) |
| coverage | Roma, Italy |
| creator | Bonchi, Filippo |
| date | 2013-01-23T00:00:00 |
| harvest_object_id | f4fce8c0-bb5c-4f44-a030-2e7607e54e4a |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-10-13T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/doi/10.1145/2429069.2429124 |
| set_spec | type:COMM |