Complexity problems in real time languages

DOI10.1016/S0020-0255(71)80024-5MaRDI QIDQ2547547zbMATH OpenOpenAlexFDO

Authors Walter A. Burkhard, Pravin Varaiya

Publication date 1971

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(71)80024-5

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• scientific article; zbMATH DE number 3453573 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• On certain formal properties of grammars
• On the Computational Complexity of Algorithms
• Real time computation
• Tape-reversal bounded Turing machine computations

Cited in

(1)

• Complexity of algorithms and computations

This page was built for publication: Complexity problems in real time languages

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