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