On the non-deterministic communication complexity of regular languages (Q3586400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5779717
| 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 5779717 |
Statements
ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (English)
0 references
6 September 2010
0 references
communication complexity
0 references
regular languages
0 references
algebraic automata theory
0 references
0 references
0.998126208782196
0 references
0.8547203540802002
0 references
0.8257734775543213
0 references
0.8257734775543213
0 references
