Communication complexity method for measuring nondeterminism in finite automata (Q1854501)
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: Communication complexity method for measuring nondeterminism in finite automata |
scientific article; zbMATH DE number 1853236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity method for measuring nondeterminism in finite automata |
scientific article; zbMATH DE number 1853236 |
Statements
Communication complexity method for measuring nondeterminism in finite automata (English)
0 references
14 January 2003
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8926094174385071
0 references
0.8576443791389465
0 references
0.8566104173660278
0 references
0.8531381487846375
0 references
