scientific article

From MaRDI portal

zbMath0074.38401MaRDI QIDQ3239817

John C. Moore

Publication date: 1956


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



Related Items

The Homology of Twisted Cartesian Products, On the spaces of self homotopy equivalences for fibre spaces. II, Testing conformance of a deterministic implementation against a non-deterministic stream X-machine, $\overline{Spec\mathbb Z}$ and the Gromov norm, Unnamed Item, Using a minimal number of resets when testing from a finite state machine, Specifications in an arbitrary institution, On the group ${\mathcal E}\left[ X \right$ of homotopy equivalence maps], Varieties of contextuality based on probability and structural nonembeddability, Survey article: an elementary illustrated introduction to simplicial sets, Analogues of quantum complementarity in the theory of automata, New techniques for proving the decidability of equivalence problem, State identification, existence of sequences and machine classification, Principal Cofibrations in the Category of Simplicial Groups, Non-contextual chocolate balls versus value indefinite quantum cryptography, The equivalence in the DCP model, (Braided) tensor structures on homotopy groupoids and nerves of (Braided) categorical groups1, 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, On the spaces of self homotopy equivalences for fibre spaces, Fuzzy neural networks, Simplicial homotopy theory, Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices, Pumping lemmas for term languages, Equivalence problem of non-deterministic finite automata, Synthesis of probability transformers, Time-varying sequential machines, Quelques propriétés des fibrés au sens de Kan, Functional Kan Simplicial Sets: Non-Constructivity of Exponentiation, Towards Behavioral Maude, Polynomial complete problems in automata theory, The relationship between the diagonal and the bar constructions on a bisimplicial set, On the construction of standard complexes, Composition sequences for functions over a finite domain., Cohomology with coefficients in symmetric cat-groups. An extension of Eilenberg–MacLane's classification theorem, Partially ordered sets and semi-simplicial complexes