Computational complexity of formal translations

DOI10.1007/BF01762186zbMath0302.68066OpenAlexW2040103597MaRDI QIDQ4057597

Juris Hartmanis

Publication date: 1975

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762186

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (3)

On the power of recursive optimizers ⋮ Syntax and semantics of universal programming languages ⋮ Toward an abstract theory of data compression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of LR(k) parsers
• Optimal enumerations and optimal gödel numberings
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity

This page was built for publication: Computational complexity of formal translations