Acyclic networks maximizing the printing complexity (Q703493)
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 2126083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic networks maximizing the printing complexity |
scientific article; zbMATH DE number 2126083 |
Statements
Acyclic networks maximizing the printing complexity (English)
0 references
11 January 2005
0 references
Complexity
0 references
Automata
0 references
Transducers
0 references
Worst-case
0 references
0.9344875812530518
0 references
0.645492434501648
0 references
0.6405372023582458
0 references
0.6405372023582458
0 references
