scientific article; zbMATH DE number 3310090
From MaRDI portal
zbMath0195.02501MaRDI QIDQ5590815
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages, Iterated uniform finite-state transducers on unary languages, Remarks on algebraic decomposition of automata, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Some properties of Ising automata, Complete classes of automata for the \(\alpha _ 0\)-product, On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products, Decomposition of linear sequential machines, Stratified petri nets, On a representation of tree automata, Unnamed Item, Decomposition of linear sequential machines. II, The accounting system as an algebraic automaton, On Reductants of Two Groups, Structural equivalence of automata, Unnamed Item, Stochastic token theory, Unnamed Item, Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*, Unnamed Item, Algorithms for the inverse and a generalization of the state space approach to finite automata, Some structural properties of generalized automata and algebras, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, AUTOMATA COMPUTATION OF BRANCHING LAWS FOR ENDOMORPHISMS OF CUNTZ ALGEBRAS, Some aspects of the geometry of first-quantized theories. II, Financial laws as algebraic automata, On the semigroup of a linear nonsingular automaton, Homology theories and tolerance automata, Critical classes for the \(\alpha _ 0\)-product, Automata represented by products of soliton automata, On the structure of systematic prefix codes, Unnamed Item, Physics of selective systems: Computation and biology, Binary systems all subsets of which are recognizable, Equational properties of fixed-point operations in cartesian categories: An overview, The complexity of social groups and social systems described by graph structures, An algebraic characterization of deterministic regular languages over infinite alphabets., Generic asymptotic error estimates for the numerical simulation of hybrid systems, Rank and statistical mapping of a strongly connected automaton, Results on homomorphic realization of automata by \(\alpha_ 0\)-products, Unnamed Item, The complexity of computing the automorphism group of automata and related problems, \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets, Modal functions for concise definition of state machines and products, REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, Unnamed Item, Iterated uniform finite-state transducers on unary languages, A decomposition theorem for probabilistic transition systems, Concurrent secrets, Algebraic and functional specification of an interactive serializable database interface, Normal forms for connectedness in categories, Fuzzy neural networks, On the Krohn-Rhodes Cascaded Decomposition Theorem, Representation of a class of nondeterministic semiautomata by canonical words., Prefix codes, trees, and automata, Cascades of tree-automata and computations in universal algebras, Prefix codes and isomorphic automata, Predictable semiautomata, A characterization of automata and a direct product decomposition, Some aspects of the geometry of first-quantized theories, Direct or cascade product of pushdown automata, Regular subsets in semi-direct products of monoids, Observational interpretation of Casl specifications, Descriptional complexity of iterated uniform finite-state transducers, THE DECOMPOSITION OF TOLERANCE AUTOMATA, Générateurs algébriques et systèmes de paires iterantes, Characterizing the regular prefix codes and right power-bounded languages, Characterizations for the regular prefix codes and related families, Invariants and closures in the theory of rewrite systems, Congruences et automorphismes des automates finis, ON TOLERATING AUTOMATA, Dot-depth of star-free events, On locally reversible languages, Group axioms for iteration, Characterizations of locally testable events, Language preorder as a precongruence, A proof of the Krohn--Rhodes Decomposition Theorem, \(n\)-ary Cartesian composition of automata, Unnamed Item, Some classes of automata as partially ordered sets, Networks of constraints: Fundamental properties and applications to picture processing, On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs, Mutually divisible semigroups, The complexity of restricted regular expressions and the synthesis problem for finite automata, Prelogical relations, Lattice valued relations and automata, Unnamed Item, Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power, On the fine-structure of regular algebra, On the elementary partitions of the state set in a multiple-input semiautomaton, Fuzzy recognizers and recognizable sets, Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets, Power-separating regular languages, Semigroups and automorphism groups of strongly connected automata, A Fully Equational Proof of Parikh's Theorem
