Slave Memories and Dynamic Storage Allocation

DOI10.1109/PGEC.1965.264263MaRDI QIDQ5329397zbMATH OpenFDO

Authors I. S. Reed

Publication date 1965

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/PGEC.1965.264263

zbMATH Keywords

numerical analysis

Cited in

(3)

• Minimal coverings for incompletely specified sequential machines
• A generalization of the theory of incompletely specified machines
• On minimal covering of incompletely specified sequential networks

This page was built for publication: Slave Memories and Dynamic Storage Allocation

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