On the Non-deterministic Communication Complexity of Regular Languages (Q3533002)
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 Non-deterministic Communication Complexity of Regular Languages |
scientific article; zbMATH DE number 5359019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Non-deterministic Communication Complexity of Regular Languages |
scientific article; zbMATH DE number 5359019 |
Statements
On the Non-deterministic Communication Complexity of Regular Languages (English)
0 references
30 October 2008
0 references
0 references
0.998126208782196
0 references
0.8517705202102661
0 references
0.8250524401664734
0 references
0.8250524401664734
0 references
