On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2009.03.020 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2009.03.020 / rank | |||
Normal rank | |||
Latest revision as of 18:34, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's |
scientific article |
Statements
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (English)
0 references
7 August 2009
0 references
communication complexity
0 references
descriptional complexity
0 references
finite automata
0 references
nondeterminism
0 references
0 references
0 references
