"Tight Bounds for the State Complexity of Deterministic Cover Automata."

Cezar Câmpeanu, Andrei Paun, Jason R. Smith (2006)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2019-03-14

- no documents available
- export record
  dblp key:
  - conf/dcfs/CampeanuPS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/CampeanuPS06
Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231

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.