scientific article; zbMATH DE number 3266653

From MaRDI portal
Publication:5551191

zbMath0166.27201MaRDI QIDQ5551191

David A. Huffman

Publication date: 1954


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

Learning fallible deterministic finite automataAbstract biological systems as sequential machinesEfficient minimization of homogeneous FSMs for fault diagnosisSome isomorphism results for Thompson-like groups \(V_n(G)\)Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducerRobust corrective control against fundamental and non-fundamental mode attacks with application to an asynchronous digital systemSynchronization paradigm for protocol testing under multiparty configurationHopcroft’s Algorithm and Cyclic AutomataSpecified sequence linear feedback shift registersHyper-minimizing minimized deterministic finite state automataLogical feedbackGeneralized ternary simulation of sequential circuitsCycle-aware minimization of acyclic deterministic finite-state automataAn O(n \text{log} n) implementation of the standard method for minimizing n-state finite automataMinimisation of acyclic deterministic automata in linear timeFault tolerance in distributed systems using fused state machinesDiagrammatic Reasoning for Delay-Insensitive Asynchronous CircuitsMinimization of Finite State Automata Through Partition AggregationMinimization of mealy finite-state machines by internal states gluingModels of asynchronous logical circuits and delaysAsynchronous Logic Circuits and Sheaf ObstructionsAggregation-based minimization of finite state automataUnnamed ItemSynthesis of probability transformersThe memory orders of states of an automatonThe Differential Analysis of S-FunctionsExtensions of asynchronous circuits and the delay problem. I: Good extensions and the delay problem of the first kindMethod for state reduction of automata taking into account technical peculiarities of synchronous and asynchronous operational modesSorting and doubling techniques for set partitioning and automata minimization problemsUnnamed ItemAnalysis of asynchronous logic circuits



Cites Work


This page was built for publication: