| Article Details | ||
|---|---|---|
| Title: | A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton | |
| Article URLs: | ||
| Alternative Article URLs: | https://arxiv.org/abs/1711.03993 | |
| Authors: | Mikhail A. Raskin |
|
| Sharing: | Research produced no artifacts | |
| Verification: | Author has verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | ||
| DBLP Key: | conf/icalp/Raskin18 | |
| Author Comments: | ||