"Circuit complexity of regular languages."

Michal Koucký (2021)

> Home

Details and statistics

DOI: 10.4171/AUTOMATA-1/14

access: closed

type: Part in Book or Collection

metadata version: 2022-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/ems/21/000121
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/ems/21/000121
Michal Koucký:
Circuit complexity of regular languages. Handbook of Automata Theory (I.) 2021: 493-523

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.