Time-restricted sequence generation

DOI10.1016/S0022-0000(70)80012-5MaRDI QIDQ2537897zbMATH OpenFDO

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

Full work available at URL https://doi.org/10.1016/S0022-0000(70)80012-5

zbMATH Keywords

computer science and automata

Cites work

• Counter machines and counter languages
• scientific article; zbMATH DE number 3201659 (Why is no real title available?)
• On the Computational Complexity of Algorithms
• Real time computation
• Real-Time Definable Languages
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Turing machines with a schedule to keep
• Two-Tape Simulation of Multitape Turing Machines

Cited in

(7)

• Complexity of algorithms and computations
• Theory of -languages. I: Characterizations of -context- free languages
• scientific article; zbMATH DE number 3633717 (Why is no real title available?)
• Production en temps réel et complexité de structure de suites infinies
• Iterative devices generating infinite words
• Uniform tag sequences
• Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks

This page was built for publication: Time-restricted sequence generation

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