"Circuit Complexity of Regular Languages."

Michal Koucký (2009)

> Home

Details and statistics

DOI: 10.1007/S00224-009-9180-Z

access: closed

type: Journal Article

metadata version: 2020-07-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Koucky09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Koucky09
Michal Koucký:
Circuit Complexity of Regular Languages. Theory Comput. Syst. 45(4): 865-879 (2009)

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.