scientific article
From MaRDI portal
Publication:3285871
zbMath0102.33804MaRDI QIDQ3285871
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Output Completeness in Sequential Machines, Minimal solutions of Paull-Unger problems, A Theory of Computer Instructions, On a group-matrix type automaton with output, On categories of infinite automata, Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines, Deterministic automata. Simulation, universality and minimality, A formalization of measurement scale forms, Abstract biological systems as sequential machines, Unnamed Item, A survey of state vectors, On the control of incompletely described sequential machines, Generalizing finiteness conditions of labelled transition systems, Products of Automata and the Problem of Covering, On optimization of numerical algorithms, Data machines and standards, or the functional specification of information systems, Arithmetische Prädikate über einem Bereich endlicher Automaten, Fuzzy neural networks, Computing the ideal structure of finite semigroups, A mode of decomposition of regular languages, Two definitions of the equivalence of automata, On homomorphic images of transition graphs, ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON, A practical general method for constructing LR(k) parsers, On topological machines, Sur une variante des fonctions séquentielles, Rosen's \((M,R)\) system as an X-machine, Automata theory and control theory - a rapprochement, On some properties of the free monoids with applications to automata theory, Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata, Some results on the relation between automata and their automorphism groups, On the corrective control of sequential machines, Eine Bemerkung zur Zustandsreduktion unvollständiger Automaten, Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen, AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS, Zur Theorie endlicher Automaten, Tree acceptors and some of their applications, Der programmierbare endliche Automat. (The programmable finite automaton), Enumerating regular expressions and their languages, On the inference of Turing machines from sample computations, Finiteness conditions for finitely generated monoids, The common algebraic structure of exit-automata and machines, Abstract biological systems as sequential machines: Behavioral reversibility, Construction of recognition devices for regular languages from their Backus Normal Form definition, Finite synchronous automata, Fuzzy acceptors for syntactic pattern recognition, Permutation automata
