"From automata to cyclic proofs : equivalence algorithms and descriptive ..."

Laureline Pinault (2021)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-02-01

- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - phd/hal/Pinault21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Pinault21
Laureline Pinault:
From automata to cyclic proofs : equivalence algorithms and descriptive complexity. (Des automates aux preuves cycliques : algorithmes d'équivalence et complexité descriptive). University of Lyon, France, 2021

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.