On the computational complexity of infinite words. (Q1401236): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: ITERATIVE DEVICES GENERATING INFINITE WORDS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logical basis for information theory and probability theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5485976 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4529547 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00400-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987848771 / rank | |||
Normal rank | |||
Latest revision as of 10:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of infinite words. |
scientific article |
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
