Time-restricted sequence generation
From MaRDI portal
Publication:2537897
DOI10.1016/S0022-0000(70)80012-5zbMath0191.18301MaRDI QIDQ2537897
Albert R. Meyer, Patrick C. Fischer, Arnold L. Rosenberg
Publication date: 1970
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Real-time computability of real numbers by chemical reaction networks ⋮ Iterative devices generating infinite words ⋮ Unnamed Item ⋮ Complexity of algorithms and computations ⋮ Uniform tag sequences ⋮ Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages ⋮ Production en temps réel et complexité de structure de suites infinies
Cites Work
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Real time computation
- On the Computational Complexity of Algorithms
- Two-Tape Simulation of Multitape Turing Machines
- Real-Time Definable Languages
- Turing machines with a schedule to keep
- Counter machines and counter languages
- Unnamed Item
