scientific article; zbMATH DE number 3266653
From MaRDI portal
Publication:5551191
zbMath0166.27201MaRDI QIDQ5551191
Publication date: 1954
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
Learning fallible deterministic finite automata ⋮ Abstract biological systems as sequential machines ⋮ Efficient minimization of homogeneous FSMs for fault diagnosis ⋮ Some isomorphism results for Thompson-like groups \(V_n(G)\) ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ Robust corrective control against fundamental and non-fundamental mode attacks with application to an asynchronous digital system ⋮ Synchronization paradigm for protocol testing under multiparty configuration ⋮ Hopcroft’s Algorithm and Cyclic Automata ⋮ Specified sequence linear feedback shift registers ⋮ Hyper-minimizing minimized deterministic finite state automata ⋮ Logical feedback ⋮ Generalized ternary simulation of sequential circuits ⋮ Cycle-aware minimization of acyclic deterministic finite-state automata ⋮ An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata ⋮ Minimisation of acyclic deterministic automata in linear time ⋮ Fault tolerance in distributed systems using fused state machines ⋮ Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits ⋮ Minimization of Finite State Automata Through Partition Aggregation ⋮ Minimization of mealy finite-state machines by internal states gluing ⋮ Models of asynchronous logical circuits and delays ⋮ Asynchronous Logic Circuits and Sheaf Obstructions ⋮ Aggregation-based minimization of finite state automata ⋮ Unnamed Item ⋮ Synthesis of probability transformers ⋮ The memory orders of states of an automaton ⋮ The Differential Analysis of S-Functions ⋮ Extensions of asynchronous circuits and the delay problem. I: Good extensions and the delay problem of the first kind ⋮ Method for state reduction of automata taking into account technical peculiarities of synchronous and asynchronous operational modes ⋮ Sorting and doubling techniques for set partitioning and automata minimization problems ⋮ Unnamed Item ⋮ Analysis of asynchronous logic circuits
Cites Work
This page was built for publication: