scientific article; zbMATH DE number 3313249

Cited in

(61)

Enumeration of hypergraphs. I
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
Fuzzy Symmetric Functions with Don't‐care Conditions and Applications
On the number of prime implicants
Bridged graphs, circuits and Fibonacci numbers
Finite automata play repeated prisoner's dilemma with information processing costs
Group theoretical and combinatorial analysis of histocompatibility and switching algebra
Complexity and organizational architecture
Convex subsets of \(2^n\) and bounded truth-table reducibility
Context-sensitive immediate constituent analysis: Context-free languages revisited
Classes of discrete optimization problems and their decision problems
Transforming sequential systems into concurrent systems
Classic: A hierarchical clustering algorithm based on asymmetric similarities
The symmetry rule in propositional logic
An interconnection of local maps inducing onto global maps
Solvable classes of discrete dynamic programming
Enumerating Types of Boolean Functions
T-equivalences generated by shape function on the real line.
Algebraic nonlinearity and its applications to cryptography
Maximin, Minimax, and composite sequential machines
FLAWS OF FORM
A catalog of Boolean concepts.
On generalizations of separating and splitting families
Better lower bounds for monotone threshold formulas
Decomposition of linear sequential machines. II
The polynomial-time hierarchy
Difference operators and extended truth vectors for discrete functions
On quotient machines of a fuzzy automaton and the minimal machine
An invariant for bounded-to-one factor maps between transitive sofic subshifts
Topological conjugacy for sofic systems
Topics in the theory of DNA computing.
Local maps inducing surjective global maps of one-dimensional tessellation automata
Transformation completeness properties of SVPC transformation sets
On the complexity of the evaluation of transient extensions of Boolean functions
Order-configuration functions: Mathematical characterizations and applications to digital signal and image processing
Heuristic NPN classification for large functions using AIGs and LEXSAT
On the structure of counterexamples to symmetric orderings for BDD's
An atlas of robust, stable, high-dimensional limit cycles
Errors can increase cooperation in finite populations
Maximin sequential-like machines and chains
Fuzzy neural networks
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
Time-varying linear sequential machines. I
Enumerating fuzzy switching functions and free Kleene algebras
Transitive reduction of a nilpotent Boolean matrix
Construction of recognition devices for regular languages from their Backus Normal Form definition
Die Automatentheorie als Teilgebiet der angewandten Mathematik
Decomposition of linear sequential machines
Trees with structures
Nonuniform complexity classes specified by lower and upper bounds
Decomposable maps in general tessellation structures
A new normal form of Boolean functions
Regular expressions and the equivalence of programs
A new lower bound on the expected size of irredundant forms for Boolean functions
Nondegenerate functions and permutations
On observability of discrete-event systems

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)