Optimal simulation of automata by neural nets

DOI10.1007/3-540-59042-0_85MaRDI QIDQ4596634zbMATH OpenOpenAlexFDO

Authors Piotr Indyk

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_85

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Efficient simulation of finite automata by neural nets
• Analog neuron hierarchy
• On the computational power of neural nets
• Turing computability with neural nets
• scientific article; zbMATH DE number 4092810

Cited in

(19)

• Frontier between decidability and undecidability: A survey
• Quasi-periodic \(\beta\)-expansions and cut languages
• On the computational power of neural nets
• Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings
• Analog neuron hierarchy
• Criterion of neural generation of automaton functions with time delay
• Subrecursive neural networks
• The case for hypercomputation
• scientific article; zbMATH DE number 4092810 (Why is no real title available?)
• Theory of neuromata
• Efficient simulation of finite automata by neural nets
• scientific article; zbMATH DE number 2070737 (Why is no real title available?)
• The computational limits to the cognitive power of the neuroidal tabula rasa
• scientific article; zbMATH DE number 1832353 (Why is no real title available?)
• Energy complexity of recurrent neural networks
• Positive neural networks in discrete time implement monotone-regular behaviors
• Cut languages in rational bases
• Three analog neurons are Turing universal
• Hopfield languages

This page was built for publication: Optimal simulation of automata by neural nets

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