Boolean Matrices and the Stability of Neural Nets

DOI10.1109/PGEC.1963.263415MaRDI QIDQ5730445zbMATH OpenFDO

Authors E. J. Jun. McCluskey, Janusz Brzozowski

Publication date 1963

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/PGEC.1963.263415

zbMATH Keywords

numerical analysis

Cited in

(23)

• Acyclic automata and small expressions using multi-tilde-bar operators
• Automata and rational expressions
• Manipulation of regular expressions using derivatives: an overview
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• Commutative images of rational languages and the Abelian kernel of a monoid
• Multi-tilde Operators and Their Glushkov Automata
• Implementation of State Elimination Using Heuristics
• Small Extended Expressions for Acyclic Automata
• Comparative analysis of automata with a common input alphabet
• An efficient algorithm for finding kleene closure of regular expression matrices
• Kleene theorems for product systems
• scientific article; zbMATH DE number 3293675 (Why is no real title available?)
• From two-way transducers to regular function expressions
• Regular expressions and transducers over alphabet-invariant and user-defined labels
• From Hadamard expressions to weighted rotating automata and back
• From Hadamard expressions to weighted rotating automata and back
• The Boolean Determinant Calculus
• Toward the Glushkovization of automata: the strong stabilization
• Deterministic suffix-reading automata
• Multi-tilde-bar expressions and their automata
• Deterministic suffix-reading automata
• Obtaining shorter regular expressions from finite-state automata
• Generalizations of 1-deterministic regular languages

This page was built for publication: Boolean Matrices and the Stability of Neural Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5730445)