Efficient simulation of finite automata by neural nets
From MaRDI portal
Publication:4302844
DOI10.1145/103516.103523zbMath0799.68138OpenAlexW1973756824MaRDI QIDQ4302844
Teunis J. Ott, A. K. Dewdney, Noga Alon
Publication date: 13 November 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/103516.103523
Related Items
A McCulloch-Pitts neural net to characterize even linear languages, THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS, Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Subrecursive neural networks, Neural networks and complexity theory, Three analog neurons are Turing universal, A provably stable neural network Turing machine with finite precision and time, Quasi-periodic \(\beta\)-expansions and cut languages, Energy Complexity of Recurrent Neural Networks, Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors, Characterizations of fuzzy finite automata., Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings, Analog neuron hierarchy, Turing computability with neural nets, Cut Languages in Rational Bases, Neural networks as systems for recognizing patterns
