On the Minimal Complexity of Component-Machines for Self-Correcting Networks

DOI10.1080/01969727508545923MaRDI QIDQ4119133zbMATH OpenOpenAlexFDO

Authors Lutz Priese

Publication date 1976

Published in Journal of Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01969727508545923

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(1)

• Universal asynchronous iterative arrays of Mealy automata

This page was built for publication: On the Minimal Complexity of Component-Machines for Self-Correcting Networks

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