scientific article; zbMATH DE number 3264081

zbMath0165.02303MaRDI QIDQ5549816

Taylor Booth

Publication date: 1967

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

zbMATH Keywords

languages, automata, networks

Related Items (31)

Unnamed Item ⋮ Probabilistic parallel prefix computation ⋮ Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ Über Automatenmodelle in der statistischen Lerntheorie ⋮ The equivalence between fuzzy Mealy and fuzzy Moore machines ⋮ An unpredictability approach to finite-state randomness ⋮ Automaton logic ⋮ Convex stochastic sequential machines ⋮ Periods Distribution in the Linear Feedback Generalized Registers ⋮ Musical genres: beating to the rhythms of different drums ⋮ Unnamed Item ⋮ Transition matrices in the measurement and control of synchronous sequential machines ⋮ Regularity and chaos in recurrent fuzzy systems. ⋮ A comparative analysis of recent identification approaches for discrete-event systems ⋮ Synchronizing Automata and the Černý Conjecture ⋮ LINEAR SYSTEM CANONICAL FORMS ⋮ Stochastic automaton models for the temporal pattern discrimination of nerve impulse sequences ⋮ A spectral theoretic approach to fault analysis in linear sequential circuits ⋮ A practical general method for constructing LR(k) parsers ⋮ On topological machines ⋮ On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility ⋮ Synthesis of linear sequential machines† ⋮ Properties of stochastic syntax-directed translation schemata ⋮ Characterizing sets of data structures by the connectivity relation ⋮ Cofunction in composite systems ⋮ Solvable classes of discrete dynamic programming ⋮ Conceptual modeling of data base operations ⋮ Multiple-entry finite automata ⋮ On permutations of wires and states ⋮ Synthesis of real time acceptors ⋮ PROBABILISTIC FINITE STATE SYSTEM IDENTIFICATION

This page was built for publication: