"State Complexity of Regular Languages: Finite versus Infinite."

Cezar Câmpeanu, Kai Salomaa, Sheng Yu (2000)

> Home

Details and statistics

DOI: 10.1007/978-1-4471-0751-4_5

access: closed

type: Part in Book or Collection

metadata version: 2020-03-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/sp/00/CampeanuSY00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/00/CampeanuSY00
Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
State Complexity of Regular Languages: Finite versus Infinite. Finite Versus Infinite 2000: 53-73

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.