Pages that link to "Item:Q4302844"
From MaRDI portal
The following pages link to Efficient simulation of finite automata by neural nets (Q4302844):
Displayed 17 items.
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- Turing computability with neural nets (Q1190653) (← links)
- Neural networks as systems for recognizing patterns (Q1270539) (← links)
- A McCulloch-Pitts neural net to characterize even linear languages (Q1350293) (← links)
- Characterizations of fuzzy finite automata. (Q1426246) (← links)
- Quasi-periodic \(\beta\)-expansions and cut languages (Q1704578) (← links)
- Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings (Q1980415) (← links)
- Analog neuron hierarchy (Q1982432) (← links)
- Subrecursive neural networks (Q2183681) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Neural networks and complexity theory (Q5096819) (← links)
- Energy Complexity of Recurrent Neural Networks (Q5378352) (← links)
- Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors (Q5380357) (← links)
- Cut Languages in Rational Bases (Q5739007) (← links)
- Three analog neurons are Turing universal (Q6049076) (← links)
- A provably stable neural network Turing machine with finite precision and time (Q6193467) (← links)