scientific article; zbMATH DE number 3266639
From MaRDI portal
Publication:5551177
zbMath0166.26802MaRDI QIDQ5551177
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Complexity of limit-cycle problems in Boolean networks ⋮ Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) ⋮ Generalized information-lossless automata. I ⋮ Linear analysis of switching nets ⋮ Reversion of outputs of fuzzy discrete systems ⋮ Pushdown and Lempel-Ziv depth ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ Bounded Pushdown Dimension vs Lempel Ziv Information Density ⋮ Ring testing of discrete devices implementing polynomtal forms ⋮ On the Difference Between Finite-State and Pushdown Depth ⋮ CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY ⋮ Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\) ⋮ Break Finite Automata Public Key Cryptosystem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Boolean automata isolated cycles and tangential double-cycles dynamics ⋮ Establishing certain bounds concerning finite automata ⋮ Structure of weakly invertible semi-input-memory finite automata with delay 1 ⋮ Abstract biological systems as sequential machines: Behavioral reversibility ⋮ \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
This page was built for publication:
