scientific article; zbMATH DE number 3313249
From MaRDI portal
Publication:5593643
zbMath0196.51702MaRDI QIDQ5593643
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (61)
Algebraic nonlinearity and its applications to cryptography ⋮ Decomposition of linear sequential machines ⋮ Maximin sequential-like machines and chains ⋮ On generalizations of separating and splitting families ⋮ On quotient machines of a fuzzy automaton and the minimal machine ⋮ Finite automata play repeated prisoner's dilemma with information processing costs ⋮ ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS ⋮ Better lower bounds for monotone threshold formulas ⋮ On observability of discrete-event systems ⋮ AN ATLAS OF ROBUST, STABLE, HIGH-DIMENSIONAL LIMIT CYCLES ⋮ Decomposition of linear sequential machines. II ⋮ An invariant for bounded-to-one factor maps between transitive sofic subshifts ⋮ Topological conjugacy for sofic systems ⋮ An interconnection of local maps inducing onto global maps ⋮ A catalog of Boolean concepts. ⋮ Errors can increase cooperation in finite populations ⋮ Context-sensitive immediate constituent analysis: Context-free languages revisited ⋮ Anomalies in the transcriptional regulatory network of the yeast \textit{Saccharomyces cerevisiae} ⋮ The symmetry rule in propositional logic ⋮ Transformation completeness properties of SVPC transformation sets ⋮ Bridged graphs, circuits and Fibonacci numbers ⋮ A new lower bound on the expected size of irredundant forms for Boolean functions ⋮ Nondegenerate functions and permutations ⋮ Fuzzy neural networks ⋮ Classes of discrete optimization problems and their decision problems ⋮ Transforming sequential systems into concurrent systems ⋮ A new normal form of Boolean functions ⋮ Complexity and organizational architecture ⋮ Difference operators and extended truth vectors for discrete functions ⋮ A characterization of automata and a direct product decomposition ⋮ The polynomial-time hierarchy ⋮ FLAWS OF FORM ⋮ Convex subsets of \(2^n\) and bounded truth-table reducibility ⋮ Addressable approximations to nonaddressable data graphs ⋮ Local maps inducing surjective global maps of one-dimensional tessellation automata ⋮ On the number of prime implicants ⋮ Decomposable maps in general tessellation structures ⋮ Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata ⋮ A theoretical analysis of the effects of amygdalectomy and of organismi motivation ⋮ Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT ⋮ Order-configuration functions: Mathematical characterizations and applications to digital signal and image processing ⋮ Infinite linear sequential machines ⋮ Regular expressions and the equivalence of programs ⋮ Maximin, Minimax, and composite sequential machines ⋮ Time-varying linear sequential machines. I ⋮ Trees with structures ⋮ Enumerating Types of Boolean Functions ⋮ Unnamed Item ⋮ Nonuniform complexity classes specified by lower and upper bounds ⋮ Group theoretical and combinatorial analysis of histocompatibility and switching algebra ⋮ On the Structure of Counterexamples to Symmetric Orderings for BDD's ⋮ Enumeration of hypergraphs. I ⋮ Enumeration of hypergraphs. I ⋮ Solvable classes of discrete dynamic programming ⋮ Enumerating fuzzy switching functions and free Kleene algebras ⋮ Topics in the theory of DNA computing. ⋮ Transitive reduction of a nilpotent Boolean matrix ⋮ Construction of recognition devices for regular languages from their Backus Normal Form definition ⋮ Classic: A hierarchical clustering algorithm based on asymmetric similarities ⋮ Die Automatentheorie als Teilgebiet der angewandten Mathematik ⋮ Fuzzy Symmetric Functions with Don't‐care Conditions and Applications
This page was built for publication:
