Lower bounds for unambiguous automata via communication complexity (Q6560928)
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: Lower bounds for unambiguous automata via communication complexity |
scientific article; zbMATH DE number 7870336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for unambiguous automata via communication complexity |
scientific article; zbMATH DE number 7870336 |
Statements
Lower bounds for unambiguous automata via communication complexity (English)
0 references
24 June 2024
0 references
unambiguous automata
0 references
communication complexity
0 references
