"A Compact Proof of Decidability for Regular Expression Equivalence."

Andrea Asperti (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-32347-8_19

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/itp/Asperti12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itp/Asperti12
Andrea Asperti:
A Compact Proof of Decidability for Regular Expression Equivalence. ITP 2012: 283-298

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.