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
Removed claim: author (P16): Item:Q208754 |
Changed an Item |
||
| Property / author | |||
| Property / author: Juraj Hromkovič / rank | |||
Normal rank | |||
Revision as of 03:08, 11 February 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
