"Descriptional Complexity of Power and Positive Closure on Convex Languages."

Michal Hospodár (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-23679-3_13

access: closed

type: Conference or Workshop Paper

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wia/Hospodar19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/Hospodar19
Michal Hospodár:
Descriptional Complexity of Power and Positive Closure on Convex Languages. CIAA 2019: 158-170

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.