On the computational complexity of infinite words.

DOI10.1016/S0304-3975(02)00400-0zbMath1044.68055OpenAlexW1987848771MaRDI QIDQ1401236

Pavol Ďuriš, Ján Maňuch

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00400-0

zbMATH Keywords

Computational complexityInfinite wordsdgsmDouble and Triple D0L TAG systems

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• ITERATIVE DEVICES GENERATING INFINITE WORDS
• Logical basis for information theory and probability theory
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computational complexity of infinite words.