Automata of high complexity and methods of increasing their reliability by redundancy

DOI10.1016/S0019-9958(58)90102-5MaRDI QIDQ3250916zbMATH OpenFDO

Authors Lars Löfgren

Publication date 1958

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(58)90102-5

zbMATH Keywords

numerical analysis

Cited in

(1)

• Solution to the realizability problem for irredundant Boolean branch- networks

This page was built for publication: Automata of high complexity and methods of increasing their reliability by redundancy

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