ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:05, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES |
scientific article |
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
