A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825)
From MaRDI portal
scientific article; zbMATH DE number 7376065
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton |
scientific article; zbMATH DE number 7376065 |
Statements
28 July 2021
0 references
unambiguous automata
0 references
language complement
0 references
lower bound
0 references
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (English)
0 references
