Boolean Matrices and the Stability of Neural Nets
From MaRDI portal
Publication:5730445
DOI10.1109/PGEC.1963.263415zbMath0119.12903MaRDI QIDQ5730445
E. J. Jun. McCluskey, Janusz A. Brzozowski
Publication date: 1963
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Related Items (20)
Manipulation of regular expressions using derivatives: an overview ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ The Boolean Determinant Calculus ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Unnamed Item ⋮ Generalizations of 1-deterministic regular languages ⋮ Multi-tilde-bar expressions and their automata ⋮ Kleene Theorems for Product Systems ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ Implementation of State Elimination Using Heuristics ⋮ Small Extended Expressions for Acyclic Automata ⋮ Comparative analysis of automata with a common input alphabet ⋮ Automata and rational expressions ⋮ An efficient algorithm for finding kleene closure of regular expression matrices ⋮ From Two-Way Transducers to Regular Function Expressions ⋮ Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels ⋮ Commutative images of rational languages and the Abelian kernel of a monoid
This page was built for publication: Boolean Matrices and the Stability of Neural Nets
