The following pages link to (Q5551177):
Displaying 23 items.
- Complexity of limit-cycle problems in Boolean networks (Q831798) (← links)
- Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer (Q892410) (← links)
- Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\) (Q946779) (← links)
- Establishing certain bounds concerning finite automata (Q1844548) (← links)
- Structure of weakly invertible semi-input-memory finite automata with delay 1 (Q1850654) (← links)
- Generalized information-lossless automata. I (Q1905149) (← links)
- On Boolean automata isolated cycles and tangential double-cycles dynamics (Q2086725) (← links)
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method (Q2106620) (← links)
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
- Bounded Pushdown Dimension vs Lempel Ziv Information Density (Q2970951) (← links)
- On the Difference Between Finite-State and Pushdown Depth (Q3297767) (← links)
- Ring testing of discrete devices implementing polynomtal forms (Q3798605) (← links)
- Break Finite Automata Public Key Cryptosystem (Q4645174) (← links)
- Reversion of outputs of fuzzy discrete systems (Q5086542) (← links)
- (Q5146197) (← links)
- (Q5150611) (← links)
- CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY (Q5151262) (← links)
- Abstract biological systems as sequential machines: Behavioral reversibility (Q5517680) (← links)
- Linear analysis of switching nets (Q5615712) (← links)
- Pushdown and Lempel-Ziv depth (Q6040660) (← links)
- On principles of emergent organization (Q6571624) (← links)
- Pebble-depth (Q6589837) (← links)
- Jeopardy: an invertible functional programming language (Q6637593) (← links)
