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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042919731 / rank | |||
Normal rank | |||
Revision as of 02:27, 20 March 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
