On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's |
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
