Computational complexity of formal translations

DOI10.1007/BF01762186zbMATH Open0302.68066OpenAlexW2040103597MaRDI QIDQ4057597FDOQ4057597

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

• Title not available (Why is that?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Optimization of LR(k) parsers
• An Overview of the Theory of Computational Complexity
• Optimal enumerations and optimal gödel numberings
• Title not available (Why is that?)
• Title not available (Why is that?)

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)