Computational complexity of formal translations

DOI10.1007/BF01762186MaRDI QIDQ4057597zbMATH OpenOpenAlexFDO

Authors J. 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)

Cites work

• scientific article; zbMATH DE number 3473266 (Why is no real title available?)
• scientific article; zbMATH DE number 3566148 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• Optimal enumerations and optimal gödel numberings
• Optimization of LR(k) parsers

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4057597)