"Über die algorithmische Komplexität regulärer Sprachen."

Gregor Gramlich (2007)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  - electronic edition @ uni-frankfurt.de
  - electronic edition @ nbn-resolving.org
  authority control:
- export record
  dblp key:
  - phd/de/Gramlich2007
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/de/Gramlich2007
Gregor Gramlich:
Über die algorithmische Komplexität regulärer Sprachen. Goethe University Frankfurt, Frankfurt am Main, Germany, 2007, pp. 1-89

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.