On the computational complexity of infinite words. (Q1401236)
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 1965270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of infinite words. |
scientific article; zbMATH DE number 1965270 |
Statements
On the computational complexity of infinite words. (English)
0 references
17 August 2003
0 references
Infinite words
0 references
Computational complexity
0 references
dgsm
0 references
Double and Triple D0L TAG systems
0 references
0.7665624618530273
0 references
0.7606990933418274
0 references
0.7584628462791443
0 references
0.7556383609771729
0 references
