Comparing descriptional and computational complexity of infinite words (Q6183604)
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 7795994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing descriptional and computational complexity of infinite words |
scientific article; zbMATH DE number 7795994 |
Statements
Comparing descriptional and computational complexity of infinite words (English)
0 references
29 January 2024
0 references
0.8336758613586426
0 references
0.7728173732757568
0 references
0.7663103342056274
0 references
0.7588956952095032
0 references
