"Finding Lower Bounds for Nondeterministic State Complexity Is Hard."

Hermann Gruber, Markus Holzer (2006)

> Home

Details and statistics

DOI: 10.1007/11779148_33

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dlt/GruberH06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/GruberH06
Hermann Gruber, Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Developments in Language Theory 2006: 363-374

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.