Complexity problems in real time languages

DOI10.1016/S0020-0255(71)80024-5zbMath0222.02041OpenAlexW2054532279MaRDI QIDQ2547547

Pravin P. Varaiya, Walter A. Burkhard

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

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

Related Items (1)

Complexity of algorithms and computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real time computation
• Tape-reversal bounded Turing machine computations
• On certain formal properties of grammars
• On the Computational Complexity of Algorithms
• A Machine-Independent Theory of the Complexity of Recursive Functions

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