"Descriptional Complexity of Winning Sets of Regular Languages."

Pierre Marcus, Ilkka Törmä (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-62536-8_11

access: closed

type: Conference or Workshop Paper

metadata version: 2020-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dcfs/MarcusT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/MarcusT20
Pierre Marcus, Ilkka Törmä:
Descriptional Complexity of Winning Sets of Regular Languages. DCFS 2020: 130-141

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.